/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 vote314 views1 answer
Data format pandas
Python
11 votes304 views4 answers
Append dataframe to another dataframe
Python
1 vote311 views1 answer
Pydotprint
Python
0 vote315 views1 answer
Install simple audio in python
Python
69 votes308 views6 answers
How to activate venv python
Python
0 vote329 views1 answer
Pygame.set_volume(2.0) max volume
Python
62 votes314 views6 answers
Class python
Python
26 votes351 views8 answers
Corona
Python
0 vote345 views1 answer
Logistic regresion heart disease python
Python
6 votes322 views5 answers
Django logout
Python