/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 vote343 views1 answer
Cast image to float32
Python
0 vote377 views1 answer
Una esfera solida de radio 40 cm tiene una carga positiva
Python
1 vote336 views3 answers
Isprime python
Python
0 vote332 views1 answer
Delete all historical data django simple history
Python Django
8 votes358 views6 answers
Fizzbuzz program in python
Python
31 votes353 views4 answers
Python remove nan rows
Python
0 vote332 views1 answer
Python how to switch between true and false
Python
0 vote349 views1 answer
Python Bz2 install
Python
19 votes360 views2 answers
Learn python 3
Python
26 votes442 views5 answers
Python class name
Python