/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

22 votes266 views4 answers
Palindrome words python
Python
4 votes261 views3 answers
How to loop through dates in python
Python
0 vote267 views2 answers
Nbconvert python
Python
0 vote293 views1 answer
Python jointly shuffle list
Python
0 vote260 views1 answer
If short for python
Python
-2 votes275 views3 answers
Pyhton
Python
5 votes273 views1 answer
3d pie chart in python
Python
0 vote269 views1 answer
Py insert char at index
Python
5 votes270 views1 answer
Datetime 30 days ago python
Python
0 vote256 views1 answer
Python django os error
Python