# WARNING: this program assumes the
# fibonacci sequence starts at 1
def fib(num):
"""return the number at index num in the fibonacci sequence"""
if num <= 2:
return 1
return fib(num - 1) + fib(num - 2)
print(fib(6)) # 8def iterativeFibonacci(n):
fibList[0,1]
for i in range(1, n+1):
fibList.append(fibList[i] + fibList[i-1])
return fibList[1:]
########################### Output ##################################
""" E.g. if n = 10, the output is --> [1,1,2,3,5,8,13,21,34,55] """
def Fab(num):
x=0
y=1
while(1):
print(x)
fab=x+y
x=y
y=fab
if x>=num:
break
Fab(100)#Learnprogramo
Number = int(input("How many terms? "))
# first two terms
First_Value, Second_Value = 0, 1
i = 0
if Number <= 0:
print("Please enter a positive integer")
elif Number == 1:
print("Fibonacci sequence upto",Number,":")
print(First_Value)
else:
print("Fibonacci sequence:")
while i < Number:
print(First_Value)
Next = First_Value + Second_Value
# update values
First_Value = Second_Value
Second_Value = Next
i += 1Input:
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