How to Print the Fibonacci Sequence Using Recursion in Python

Submitted by razormist on Monday, January 26, 2026 - 22:23.

In this tutorial, we will learn how to program “How to Print the Fibonacci Sequence Using Recursion in Python.” The objective is to display the Fibonacci sequence using recursion. This tutorial will guide you step by step through the process of generating and displaying the Fibonacci sequence. By the end of this tutorial, you will have a solid understanding of how to implement recursion effectively in Python, helping you strengthen your problem-solving abilities and improve your coding skills.

This topic is straightforward and easy to understand. Simply follow the instructions provided, and you will complete it with ease. The program will guide you step by step through the process of swapping list elements without using a key in a linked list. So, let's dive into the coding process!

Getting Started:

First you will have to download & install the Python IDLE's, here's the link for the Integrated Development And Learning Environment for Python https://www.python.org/downloads/.

Creating Main Function

This is the main function of the application. The following code will display a simple GUI in terminal console that will display program. To do this, simply copy and paste these blocks of code into the IDLE text editor.

def fibonacci(n, memo={}):
    if n in memo:
        return memo[n]
    if n <= 1:
        return n
    memo[n] = fibonacci(n - 1, memo) + fibonacci(n - 2, memo)
    return memo[n]
 
 
while True:
    print("\n================= Print the Fibonacci Sequence =================\n")
 
    n = int(input("Enter number of terms: "))
    print("Fibonacci sequence:")
 
    for i in range(n):
        print(fibonacci(i), end=" ")
    print()
 
    opt = input("\nDo you want to try again? (yes/no): ").strip().lower()
    if opt == "no":
        print("Exiting program...")
        break
    elif opt != "yes":
        print("Invalid choice. Exiting program...")
        break

This program prints the Fibonacci sequence using a recursive approach optimized with memoization. It defines a Fibonacci function that stores previously computed values in a dictionary to avoid redundant calculations, making the recursion efficient even for larger inputs. The user is prompted to enter the number of terms, and the program displays the corresponding Fibonacci sequence in order. After printing the result, the program allows the user to repeat the process or exit, ensuring a simple and interactive execution flow.

Output:

There you have it we successfully created How to Print the Fibonacci Sequence Using Recursion in Python. I hope that this simple tutorial help you to what you are looking for. For more updates and tutorials just kindly visit this site. Enjoy Coding!

More Tutorials for Python Language

Python Tutorials