Python program to display Fibonacci sequence

Python complete examples

In this program, you will learn to use the recursive function to display the Fibonacci sequence.

To understand this example, you should understand the followingPython programmingTopic:

• Python for loop

• Python function

• Python recursion

The Fibonacci sequence is 0,1,1,2,3,5,8 ... integer sequence.

The first two items are 0 and1. All other items are obtained by adding the previous two items. This means that the nth item is the (n-1)^numberand^the(n-2)^numberThe sum of items.

Source code

# Python program to display Fibonacci sequence
def recur_fibo(n):
　　　if n <=　1:
　　　　　　　return n
　　　else:
　　　　　　　return(recur_fibo(n-1)　+　recur_fibo(n-2))
nterms =　10
# Check if nterms is valid
if nterms <= 0:
　　　print("Please enter a positive integer")
else:
　　　print("Fibonacci sequence:")
　　　for i in range(nterms):
　　　　　　　print(recur_fibo(i))

Output results

Fibonacci sequence:
0
1
1
2
3
5
8
13
21
34

Note:To test the program, please change the value of nterms.

In this program, we store the number of terms to be displayed in nterms.

The recursive function recur_fibo() is used to calculate the nth term of the sequence. We use a for loop to iterate and recursively calculate each term.

Visit here to learn more aboutPython recursionMore information.

Python complete examples