/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

8 votes120 views6 answers
Redirect django
Python
0 vote122 views1 answer
Find total no of true in a list in python
Python
1 vote208 views1 answer
Not null constraint failed django
Python
1 vote117 views2 answers
Python add column to a matrix
Python
6 votes120 views3 answers
Python program to get the file size of a plain file.
Python
0 vote126 views1 answer
How do i add new items to a dictionary within a for loop python
Python
8 votes124 views4 answers
Python zip folder
Python
0 vote114 views1 answer
Push notification using python
Python
9 votes133 views1 answer
Bee movie script
Python
0 vote111 views1 answer
Python inherit from objects
Python