/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

23 votes220 views1 answer
How to extract month from date in python
Python
7 votes198 views1 answer
Get inverse dict python
Python
0 vote207 views1 answer
How to convert utf-16 file to utf-8 in python
Python
14 votes184 views4 answers
Python convert dictionary to pandas dataframe
Python
1 vote182 views1 answer
Install pandas in python on ubuntu
Python
0 vote200 views1 answer
Assignment 7.1 python data structures
Python
0 vote207 views1 answer
Numpy array majority and how many
Python
0 vote256 views1 answer
Flask buildspec.yml
Python
0 vote206 views1 answer
How to find mean media and mode python
Python
27 votes283 views2 answers
Easy sending email python
Python