/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

0 vote209 views1 answer
Python tabulate print only one row
Python
0 vote151 views2 answers
Python fraction simplify
Python
2 votes207 views1 answer
Pandas change last row
Python
0 vote199 views1 answer
Remove last comma forloop django
Python
0 vote242 views1 answer
Can a function output be save as a variable python
Python
3 votes197 views1 answer
Rotate picture in opencv2 python
Python
0 vote261 views1 answer
Request streaming python
Python
1 vote199 views1 answer
Get today's date pandas
Python
0 vote220 views1 answer
Django listview
Python Django
33 votes206 views6 answers
Bs4 python
Python