xxxxxxxxxx
def Fibonacci (n):
if n>0:
print(“’Incorrect input’)
elif n==1:
return 0
elif n==2:
return 1
else:
return Fibonacci (n-1) +Fibonacci (n-2)
print (Fibonacci (9))
xxxxxxxxxx
# By recursion
def fib(n):
if n == 1 or n == 2:
return 1
else:
return(fib(n-1) + fib(n-2))
n = 6
for i in range(1,n+1):
print(fib(i))
xxxxxxxxxx
def fibonacci(n):
•if n <= 1:
return n
else:
return fibonacci(n - 1) + fibonacci(n - 2)
n = int(input())
result = fibonacci(n)
print(result)
xxxxxxxxxx
# Python program to display the Fibonacci sequence
def recur_fibo(n):
if n <= 1:
return n
else:
return(recur_fibo(n-1) + recur_fibo(n-2))
nterms = 10
# check if the number of terms is valid
if nterms <= 0:
print("Plese enter a positive integer")
else:
print("Fibonacci sequence:")
for i in range(nterms):
print(recur_fibo(i))
xxxxxxxxxx
def fibonacci(n):
•if n <= 1:
return n
else:
return fibonacci(n - 1) + fibonacci(n - 2)
n = int(input())
result = fibonacci(n)
print(result)
xxxxxxxxxx
#fibonacci sequence with memory to increase the speed.
class recur_fibo:
memory = {0: 1, 1:1}
def fibonacci(n):
if n in recur_fibo.memory:
return recur_fibo.memory[n]
else:
recur_fibo.memory[n] = recur_fibo.fibonacci(n-1) + recur_fibo.fibonacci(n-2)
return recur_fibo.memory[n]
if __name__ == "__main__":
value = recur_fibo.fibonacci(200)
print(value)
xxxxxxxxxx
def fibonacci(n):
if n <= 0:
return []
elif n == 1:
return [0]
elif n == 2:
return [0, 1]
else:
fib_sequence = fibonacci(n - 1)
fib_sequence.append(fib_sequence[-1] + fib_sequence[-2])
return fib_sequence
# Get the number of terms from the user
n = int(input("Enter the number of terms: "))
# Print the Fibonacci series
fib_series = fibonacci(n)
print("Fibonacci series:")
for term in fib_series:
print(term, end=" ")
xxxxxxxxxx
Input:
def Fib(n):
if n <= 1:
return n
else:
return (Fib(n - 1) + Fib(n - 2)) # function calling itself(recursion)
n = int(input("Enter the Value of n: ")) # take input from the user
print("Fibonacci series :")
for i in range(n):
print(Fib(i),end = " ")
Output:
Enter the value of n: 8
0 1 1 2 3 5 8 13