Print Fibonacci Series Using Recursion in Python

❮ Previous Next ❯

A Python program to generate the Fibonacci series using recursion by calling the function iteratively.

Here’s the explanation in bullet points :

Function Definition: The program defines a function fibonacci(n) to generate the nth Fibonacci number.
Base Case for Recursion: If n is 0, the function returns 0. If n is 1, it returns 1.
Recursive Case: For values of n greater than 1, the function calls itself recursively with fibonacci(n - 1) + fibonacci(n - 2), summing the previous two Fibonacci numbers.
User Input: The user is prompted to input how many Fibonacci numbers they want to generate.
Loop for Printing: A for loop runs from 0 to num - 1 and prints each Fibonacci number by calling fibonacci(i) in each iteration.
Example: If the user enters 7, the program will output the first seven Fibonacci numbers: 0 1 1 2 3 5 8.

Program:

def fibonacci(n):

    if n <= 1:

        return n

    return fibonacci(n - 1) + fibonacci(n - 2)



num = int(input("Enter the number of terms: "))



for i in range(num):

    print(fibonacci(i), end=" ")

❮ Previous Next ❯

Python Practice Questions Tutorial

Python Practice Questions Tutorial

Print Fibonacci Series Using Recursion in Python

Important Links

Python Practice Questions Tutorial

Python Practice Questions Tutorial

Python Coding Questions on Numbers

Python Coding Questions on String

Python Coding Questions On List

Python Coding Questions On Dictionary

Python Coding Questions On Star Pattern

Print Fibonacci Series Using Recursion in Python

Important Links