Python program to find the solution of a special sum series

Here, we will figure out how to discover the arrangement of a given uncommon aggregate arrangement in Python?

We are going to structure an uncommon aggregate arrangement work which has the following attributes:

    f(0) = 0
    f(1) = 1
    f(2) = 1
    f(3) = 0
    f(x) = f(x-1) + f(x-3)

Python arrangement of the above entirety arrangement:

# function to find the sum of the series
def summ(x):
    if x == 0:
        return 0
    if x == 1:
        return 1
    if x == 2:
        return 1
    if x == 3:
        return 0
    
    else:
        return summ(x-1) + summ(x-4)

# main code
if __name__ == '__main__':
    # finding the sum of the series till given value of x
    print("summ(0) :", summ(0))
    print("summ(1) :", summ(1))
    print("summ(2) :", summ(2))
    print("summ(3) :", summ(3))
    print("summ(10):", summ(10))
    print("summ(14):", summ(14))

Output:

summ(0) : 0
summ(1) : 1
summ(2) : 1
summ(3) : 0
summ(10): 5
summ(14): 17