/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 vote249 views1 answer
How to print cow on python
Python
1 vote332 views1 answer
Reached 'max' / getOption("max.print")
Python
0 vote303 views2 answers
Count specific instances in a columb in pandas
Python
2 votes335 views3 answers
Select rows in python
Python
22 votes310 views6 answers
Python how to add to a list
Python
0 vote297 views1 answer
Plt grid linestyles options
Python
23 votes453 views3 answers
Pip install django rest framework
Python Django
2 votes309 views1 answer
How to operate on all elements in a list python
Python
4 votes295 views1 answer
Np.random.uniform
Python
0 vote315 views1 answer
Python numpy kurtosis
Python