Home >>Python Programs >Python Program to Display Fibonacci Series Using Recursion
In this example, we will see a Python program to display the Fibonacci sequence using recursion. The Fibonacci sequence is a sequence of integers where first two terms are 0 and 1 and all other terms of the sequence are obtained by adding their preceding two numbers.
Example :
def recur_fibo(n):
if n <= 1:
return n
else:
return(recur_fibo(n-1) + recur_fibo(n-2))
# take input from the user
nterms = int(input("How many terms? "))
# check if the number of terms is valid
if nterms <= 0:
print("Plese enter a positive integer")
else:
print("Fibonacci sequence:")
for i in range(nterms):
print(recur_fibo(i))