/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

3 votes99 views1 answer
Pandas reciprocal
Python
0 vote104 views1 answer
Record audio with processing python
Python
34 votes93 views2 answers
Python shuffle list with seed
Python
0 vote102 views10 answers
Python
Python
0 vote123 views1 answer
Rotate image pyqt5
Python
3 votes118 views1 answer
Remove commas from string python
Python
0 vote154 views2 answers
Weigted average in pandas
Python
5 votes103 views3 answers
Convert json to csv
Python
1 vote125 views1 answer
Python count words in file
Python
0 vote94 views1 answer
Django only certain columns from database
Python