Services
Technology Web App Development Mobile App Development Windows App Development Database Development UI/UX Development Cloud Development SEO Digital Marketing Guest Posting Content Writing Artificial Intelligence Data Science ERP Development CRM Development CMS Development LMS Development Business Listing Blockchain Technology Startup Promotion AI Tools Integration
Products
Data Converter Cleaner TUC - Unit Converter Import Export Survey Manager Tweet Controller
Developer
Article Blog Forum Interview Beginner News Startup Quiz
Users
Career
Apply Job Internship
Pricing
Login Sign Up Get a Quote

interview

Home Interviews Fibonacci sequence up to N terms – MindStick
Ask Question

1 Answers

ICSM Computer
ICSM Computer 08 Sep 2025
Report Abuse

Fibonacci Sequence

The Fibonacci sequence is a series of numbers where:

F(0) = 0
F(1) = 1
F(n) = F(n-1) + F(n-2)   (for n ≥ 2)

So the sequence looks like:
0, 1, 1, 2, 3, 5, 8, 13, ...

Python Program (up to N terms)

def fibonacci(n):
    sequence = []
    a, b = 0, 1   # first two numbers

    for i in range(n):
        sequence.append(a)  # store current number
        a, b = b, a + b     # move to next two numbers

    return sequence

# Example
terms = 10
print(f"Fibonacci sequence up to {terms} terms:")
print(fibonacci(terms))

Output for terms = 10

Fibonacci sequence up to 10 terms:
[0, 1, 1, 2, 3, 5, 8, 13, 21, 34]

Explanation

  • Start with a = 0, b = 1.
  • Loop runs n times.
  • On each iteration:
    • Append a to the sequence.
    • Update a, b → shift forward (a becomes b, b becomes a+b).
  • Continue until we generate n terms.
MindStick Training
Markdown for AI

A clean, structured version of this page for AI assistants and LLMs.

Open .md