/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 vote174 views1 answer
Plague meaning
Python
0 vote156 views1 answer
Input must be string python
Python
0 vote161 views9 answers
Python how to count ever yfile in fodler
Python
6 votes163 views3 answers
Np random seed
Python
0 vote168 views1 answer
Python add encoding for non-English language like Arabic
Python
2 votes154 views3 answers
Counter to df pandas
Python
0 vote164 views1 answer
Separating a relational plot based on a sixth variable | seaborn relational plot
Python
23 votes168 views2 answers
Python How To Check if String Is Empty
Python
0 vote176 views1 answer
Python iter on a dic key value
Python
0 vote185 views1 answer
Gunicorn django static files
Python