/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 vote159 views2 answers
Check if variable is function python
Python
72 votes147 views4 answers
Check python version mac
Python
3 votes156 views2 answers
Find different values from two lists python
Python
0 vote148 views1 answer
Fake user agent python
Python
0 vote189 views1 answer
Flask sqlalchemy query specific columns
Python Flask
0 vote165 views1 answer
List addition within a list comprehension
Python
28 votes153 views4 answers
Pygame scale image
Python
1 vote110 views1 answer
Drop rows pandas where value
Python
0 vote181 views1 answer
Different types f python loops
Python
14 votes147 views6 answers
.sort python
Python