This is a Python Program to find the fibonacci series using recursion.

The program takes the number of terms and determines the fibonacci series using recursion upto that term.

1. Take the number of terms from the user and store it in a variable.

2. Pass the number as an argument to a recursive function named fibonacci.

3. Define the base condition as the number to be lesser than or equal to 1.

4. Otherwise call the function recursively with the argument as the number minus 1 added to the function called recursively with the argument as the number minus 2.

5. Use a for loop and print the returned value which is the fibonacci series.

6. Exit.

Here is source code of the Python Program to find the fibonacci series using recursion. The program output is also shown below.

def fibonacci(n): if(n <= 1): return n else: return(fibonacci(n-1) + fibonacci(n-2)) n = int(input("Enter number of terms:")) print("Fibonacci sequence:") for i in range(n): print fibonacci(i),

1. User must enter the number of terms and store it in a variable.

2. The number is passed as an argument to a recursive function.

3. The base condition is that the number has to be lesser than or equal to 1.

4. Otherwise the function is called recursively with the argument as the number minus 1 added to the function called recursively with the argument as the number minus 2.

5. The result is returned and a for statement is used to print the fibonacci series.

Case 1: Enter number of terms:5 Fibonacci sequence: 0 1 1 2 3 Case 2: Enter number of terms:7 Fibonacci sequence: 0 1 1 2 3 5 8

**Sanfoundry Global Education & Learning Series – Python Programs.**

To practice all Python programs, __here is complete set of 150+ Python Problems and Solutions__.