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 vote243 views1 answer
Python set timezone of datetime
Python
0 vote226 views1 answer
Response object has no code
Python
3 votes220 views2 answers
Numpy array sorting
Python
0 vote229 views1 answer
Python package structure
Python
124 votes231 views6 answers
Python read json file
Python
0 vote254 views1 answer
Correlation with specific columns
Python
0 vote233 views1 answer
How to check nth prime in python
Python
1 vote228 views1 answer
Django login redirect
Python Django
11 votes235 views2 answers
Discord.py presence
Python
25 votes233 views3 answers
Store all files name in a folder python
Python