/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

-1 vote208 views1 answer
Raw query in django
Python
0 vote229 views1 answer
Fakultät python
Python
44 votes291 views3 answers
Online matplotlib compiler
Python
1 vote189 views1 answer
File to lowercase python
Python
0 vote207 views1 answer
Python requests insecure request warning
Python
7 votes255 views6 answers
Install python 3 on mac
Python
0 vote224 views1 answer
Multiple sub in single regex.
Python
0 vote246 views1 answer
Python quiet future warning
Python
0 vote258 views1 answer
Python Remove all occurrences of a character from a string
Python
0 vote196 views1 answer
Python tkinter dynamic toggle button
Python