Fibonacci numbers
Recursion
def fib(n):
if n==1 or n==0:
return n
return fib(n-1)+fib(n-2)
l=int(input("enter no of terms "))
print("fibbonacci sequnce using recursion ")
for x in range(l):
print(fib(x))
