/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 vote138 views1 answer
Robinhood python api
Python
3 votes171 views1 answer
Django import model from another app
Python Django
45 votes148 views6 answers
Python webbrowser
Python
0 vote128 views1 answer
How to console log in django heroku
Python
0 vote132 views2 answers
Pytest using tempfile
Python
0 vote144 views4 answers
AttributeError: 'Database' object has no attribute 'remove'
Python
0 vote143 views2 answers
Python def example
Python
0 vote150 views1 answer
Find different between list
Python
1 vote132 views1 answer
Ctx.save_for_backward
Python
8 votes157 views2 answers
How to clear the list in python
Python