/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 vote268 views1 answer
Python max value of list of tuples
Python
0 vote264 views1 answer
Python max function with lambda
Python
0 vote260 views1 answer
Revesing case python
Python
1 vote264 views2 answers
Np.transpose(x) array([[0, 2], [1, 3]])
Python
48 votes246 views5 answers
How to change int to string in python
Python
0 vote291 views1 answer
How to get column names having numeric value in pandas
Python
-1 vote214 views1 answer
Import url
Python
1 vote261 views1 answer
Seaborn rotate xlabels
Python
0 vote263 views1 answer
Image loader RGB transform
Python
20 votes265 views6 answers
Extract tar
Python