Recursive Fibonacci

Mahendra Kumar

beginnerfucntionCallingItself

performing Fibonacci series in python using recursion. recursion means a defined function can call itself.

def fibonacci(n):
    if(n <= 1):
        return n
    else:
        return(fibonacci(n-1) + fibonacci(n-2))
n = int(input("Enter number of terms:"))
print("Fibonacci sequence:")
for i in range(n):
    print(fibonacci(i))