/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 vote174 views2 answers
Np.argsort reverse
Python
0 vote164 views1 answer
Dot operator in python
Python
1 vote165 views1 answer
How to use Python Glob Module
Python
8 votes183 views1 answer
Python make a random number
Python
6 votes173 views4 answers
Print all elements in list python
Python
0 vote185 views1 answer
Convolution operation pytorch
Python
30 votes372 views3 answers
Django create superuser from script
Python Django
2 votes189 views1 answer
Add numpy array to pandas dataframe
Python
18 votes181 views6 answers
Python resize image
Python
44 votes244 views3 answers
Online matplotlib compiler
Python