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 vote210 views1 answer
Print('Hello world!\How are you?\ and(I'm fine).') syntax error
Python
0 vote206 views1 answer
Pyspark rdd filter
Python
10 votes188 views2 answers
Relativefrequencies of the unique values pandas
Python
0 vote197 views1 answer
Save jupyter notebook session
Python
2 votes191 views2 answers
Python check if key exist in json
Python
14 votes203 views3 answers
Python int to bytes
Python
46 votes212 views5 answers
How to check uppercase in python
Python
20 votes171 views5 answers
Flatten a list of lists python
Python
0 vote220 views2 answers
Form.as_p in django
Python Django
2 votes201 views5 answers
Pandas rename single column
Python