Fibonacci recursive python

Fibonacci series python recursion

# 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))

Fibonacci sequence python

# 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))  # 8

Fibonacci recursive python

#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

Source: learnprogramo.com

Similar codes

0 vote352 views1 answer
Pyqt5 how to see if clipboard is empty
Python
18 votes376 views3 answers
Python ascii code to string
Python
0 vote341 views1 answer
Remove all integers from list python
Python
3 votes343 views1 answer
Open cv read webcam
Python
1 vote348 views1 answer
Python saveAsTextFile
Python
-5 votes334 views10 answers
Activate venv in python
Python
79 votes315 views3 answers
Reverse element in a list in python 3
Python
5 votes326 views3 answers
Debugging python
Python
0 vote308 views1 answer
Raising a new style class which doesn't inherit from baseexception python
Python
15 votes348 views4 answers
Q django
Python