/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 vote233 views2 answers
Python time a code segment
Python
50 votes217 views6 answers
Python uppercase
Python
0 vote197 views1 answer
Classical Cryptography: Using Classical Ciphers with pycipher.
Python
0 vote249 views1 answer
Python tkinter entry hide text
Python
36 votes231 views1 answer
Py sleep function
Python
1 vote247 views2 answers
Call class function by string python
Python
0 vote226 views1 answer
Custom auth django channels
Python
1 vote234 views1 answer
Timedelta to float
Python
0 vote217 views1 answer
Combine two dictionary adding values for common keys
Python
4 votes246 views3 answers
Python flip a coin
Python