# Python Program to Display Fibonacci Sequence Using Recursive Function

In this example, we will write a program that displays a fibonacci sequence using a recursive function in Python. To better understand this example, make sure you have knowledge of the following tutorials:-

A Fibonacci sequence is the integer sequence of 0, 1, 1, 2, 3, 5, 8…

The first two terms are 0 and 1. All other terms are obtained by adding the preceding two terms. This means to say the nth term is the sum of (n-1)^{th} and (n-2)^{th} term.

## Python Program to Display Fibonacci Sequence Using Recursive Function

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | def fibo(n): if n <= 1: return n else: return fibo(n-1) + fibo(n-2) terms = int(input("How many terms? ")) if terms <= 0: print("Please enter a positive integer") else: print("Fibonacci sequence:") for i in range(terms): print(fibo(i)) |

The output of the above program is:-

Fibonacci sequence:

0

1

1

2

3

5

8

13

**Program Explanation:-**