/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

2 votes203 views2 answers
Discord.py cog
Python
1 vote208 views1 answer
Pandas forward fill after upsampling
Python
0 vote199 views2 answers
How to get current page url in django template
Python
37 votes235 views5 answers
TypeError: 'NoneType' object is not subscriptable
Python
6 votes213 views3 answers
From sklearn.metrics import mean_square_error
Python
2 votes226 views2 answers
Range python start at 1
Python
0 vote209 views1 answer
How to convert a list to a string by newline python
Python
0 vote217 views2 answers
Plt.xlabel not working
Python
26 votes369 views6 answers
Flask run
Python Flask
0 vote200 views1 answer
Pandas how to start read csv at a certain row
Python