/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 vote161 views2 answers
Distribution analysis pandas
Python
0 vote129 views1 answer
Finding the rows in a dataframe where column contains any of these values python
Python
21 votes137 views4 answers
Append to pandas dataframe
Python
0 vote130 views1 answer
Dict comprehensions
Python
3 votes146 views2 answers
Python dict order a dict by key
Python
4 votes124 views1 answer
Python make comparison non case sensitive
Python
0 vote95 views1 answer
Pandas count unique index
Python
-1 vote144 views1 answer
Change tuple in python
Python
0 vote133 views1 answer
Deactivate pandas warning copy
Python
0 vote127 views1 answer
Excelwriter python
Python