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 vote139 views1 answer
Sklearn accuracy
Python
1 vote139 views1 answer
Webhook discord files
Python
10 votes124 views3 answers
Fibonacci series python recursion
Python
6 votes122 views9 answers
Create a portfolio website with html css
Python
1 vote125 views1 answer
Flask clear session
Python
4 votes137 views1 answer
Python read dictionary from file
Python
-1 vote129 views1 answer
Armstrong number function
Python
0 vote122 views1 answer
Type of tuple in python
Python
3 votes130 views2 answers
Tables in python
Python
0 vote208 views2 answers
Generate gif py
Python