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 vote144 views1 answer
Pip not downlaoding cryptography wheel macos
Python
0 vote135 views1 answer
Get drive path python
Python
0 vote140 views1 answer
Else if in django template
Python
0 vote130 views1 answer
How to open camre aopencv
Python
2 votes135 views1 answer
Continue vs pass python
Python
0 vote135 views1 answer
Defaultdict count key value pairs
Python
1 vote125 views1 answer
Start python virtual
Python
1 vote132 views1 answer
How to kill tkinter
Python
0 vote157 views1 answer
Django capture the file upload
Python Django
3 votes123 views3 answers
Steps in for loop python
Python