/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 vote147 views2 answers
Python combine two lists into matrix
Python
8 votes189 views2 answers
How to print all combinations of a string in python
Python
2 votes254 views1 answer
Write custom query odoo
Python
1 vote144 views1 answer
Combination python
Python
78 votes142 views6 answers
Python string reverse
Python
0 vote143 views2 answers
Problems on loops and if else statements
Python
0 vote124 views1 answer
Cap.release() not working
Python
1 vote136 views1 answer
Django httpresponseredirect
Python
3 votes133 views9 answers
Creating environment variable in python
Python
0 vote136 views2 answers
How can i aggregate without group by in pandas
Python