Write a program to print Fibonacci sequence up to n numbers using recursion. Fibonacci sequence is defined as below:

Fibonacci Sequence = 1 1 2 3 5 8 13 21 ...
where n th term x n = x n−1 + x n−2

Code

def fibbo(n):
if n <= 1:
return n
else:
return fibbo(n-1) + fibbo(n-2)

if __name__ == "__main__":
n = int(input("Enter a number: "))
for i in range(1, n+1):
print(fibbo(i))

Output