/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 vote111 views1 answer
How to run multiple python files one after another
Python
147 votes135 views5 answers
Python check if folder exists
Python
0 vote119 views1 answer
Matplotlib colorbar reverse direction
Python
0 vote113 views1 answer
Check how many days old file is python
Python
1 vote117 views1 answer
Tkinter toplevel
Python
0 vote110 views1 answer
Boto 3 list EMR
Python
0 vote85 views1 answer
Python django if key exists
Python Django
0 vote116 views1 answer
Task orchestration framework
Python
0 vote132 views1 answer
Test if instance in queryset django
Python
0 vote114 views1 answer
Newick string python
Python