/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 vote274 views1 answer
Remocve pyc files
Python
1 vote281 views1 answer
How to redirect to another page in django after login
Python
4 votes326 views2 answers
Authentication views django
Python Django
16 votes307 views2 answers
What is my python working directory
Python
1 vote285 views1 answer
How to config your flask for gmail
Python
0 vote264 views1 answer
Install python 3.6 dockerfile
Python
0 vote307 views1 answer
How to import pil in spyder
Python
0 vote307 views1 answer
Three different randomn numbers python
Python
0 vote296 views2 answers
How to play a mp3 file in python
Python
0 vote288 views1 answer
Python close browser
Python