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

1 vote219 views1 answer
Python inheritance remove an attribute
Python
1 vote211 views1 answer
Selenium refresh till the element appears python
Python
0 vote239 views1 answer
Arima A date index has been provided, but it has no associated frequency information and so will be ignored when e.g. forecasting
Python
0 vote219 views1 answer
When was barracoon written
Python
0 vote224 views1 answer
Make value of two tables unique django
Python
1 vote262 views1 answer
Django class based views ListView
Python Django
0 vote201 views1 answer
ModuleNotFoundError: No module named 'App_Order'
Python
17 votes221 views3 answers
Python print object
Python
1 vote282 views1 answer
How to create a list of tuples in python
Python
0 vote212 views1 answer
Picking Number challenge
Python