# Implement the fibonacci sequence
# (0, 1, 1, 2, 3, 5, 8, 13, etc...)
def fib(n):
if n== 0 or n== 1:
return n
return fib (n- 1) + fib (n- 2) >>> def fib(n): # write Fibonacci series up to n
... """Print a Fibonacci series up to n."""
... a, b = 0, 1
... while a < n:
... print(a, end=' ')
... a, b = b, a+b
... print()
...
>>> # Now call the function we just defined:
... fib(2000)
0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597# Program to display the Fibonacci sequence forever
def fibonacci(i,j):
print(i;fibonacci(j,i+j))
fibonacci(1,1)#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 += 1