/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

2 votes368 views2 answers
Python literal string
Python
0 vote377 views1 answer
Write help text python script
Python
0 vote337 views3 answers
“no such column” after adding a field to the model
Python
0 vote390 views1 answer
Print all variables jupyter notebook
Python
0 vote366 views1 answer
AttributeError: 'Series' object has no attribute 'sort' site:stackoverflow.com
Python
0 vote383 views1 answer
Python get item from list by index
Python
0 vote341 views1 answer
How to add subtitle matplotlib
Python
0 vote344 views1 answer
Compile python folder
Python
0 vote412 views1 answer
Is_valid method django
Python Django
0 vote334 views1 answer
Intellij python
Python