/Python/Fibonacci series python recursion

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 series using recursion in python

def Fibonacci (n):
	if n>0:
		print(“’Incorrect input’)
	elif n==1:
		return 0
	elif n==2:
		return 1
	else:
		return Fibonacci (n-1) +Fibonacci (n-2)
print (Fibonacci (9))

-1

Source: pythonclass.in

Similar codes

1 vote104 views1 answer
Install spotipy
Python
3 votes88 views1 answer
How to make a empty folder using os in pyhon
Python
0 vote103 views1 answer
Sum the contents of a list python
Python
32 votes131 views6 answers
Merge pandas
Python
6 votes97 views3 answers
Python get dictionary keys
Python
4 votes112 views1 answer
Pandas transpose
Python
0 vote136 views1 answer
Pdfs in django
Python Django
-4 votes100 views4 answers
Latest django version
Python
1 vote100 views1 answer
How to add list toa key in dict
Python
-1 vote123 views1 answer
Simple sum in python
Python