/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

11 votes199 views6 answers
Pandas distinct
Python
0 vote248 views1 answer
Python Remove all occurrences of a character from a string
Python
0 vote252 views1 answer
Matplotlib grid color
Python
10 votes189 views3 answers
Check python 32 or 64
Python
2 votes196 views4 answers
Urllib.request.urlretrieve
Python
0 vote144 views1 answer
Ros python service client
Python
5 votes208 views2 answers
How to add input box in tkinter
Python
0 vote240 views1 answer
How to make booking website using django step by step
Python Django
0 vote181 views1 answer
How to get a list of all values in a column df
Python
1 vote201 views2 answers
No changes detected in app django
Python