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 vote200 views1 answer
Streamlit bold
Python
21 votes182 views6 answers
How to disable right click in js
Python
0 vote155 views3 answers
Pyqt message box set information text
Python
0 vote148 views1 answer
No module named 'filterpy'
Python
0 vote154 views1 answer
Change variable type python
Python
3 votes173 views10 answers
Rick roll
Python
8 votes206 views2 answers
How to print all combinations of a string in python
Python
0 vote189 views1 answer
Np print precision
Python
0 vote180 views1 answer
S = 1 + 2 + ... + n in python
Python
-1 vote156 views2 answers
Write a python program to multiplies all the items in a list.
Python