Math

Instant, private, and free

Fibonacci Calculator.

Calculate an exact Fibonacci term or generate a bounded sequence from F₀ = 0 and F₁ = 1.

On-device calculationNo signup
01

Set your values

Results update as you type.

Whole number from 0 to 10,000.

Terms from F₀, up to 100.

Fibonacci term: 55

Fibonacci term

55

Breakdown

IndexF10
Exact typeBigInt

Sequence from F₀

0, 1, 1, 2, 3, 5, 8, 13, 21, 34

Formula

Fₙ = Fₙ₋₁ + Fₙ₋₂ for n ≥ 2. Values are calculated exactly; no floating-point rounding is used.

How to Use

The Fibonacci sequence starts F₀ = 0, F₁ = 1; each following term is the sum of the two before it.

Exact BigInt output is capped at n = 10,000; sequences are capped at 100 terms so the page stays responsive.

FAQs

What are the first Fibonacci numbers?

Using the zero-based convention, F₀ = 0, F₁ = 1, and each next term is the sum of the two preceding terms.

Are the results rounded?

No. The calculator uses exact integer arithmetic and caps the input so the browser stays responsive.

Cite this calculator

Canonical URL: https://mathify.one/de/math/fibonacci

Cite as: Mathify. (2026). Rechner: Fibonacci. https://mathify.one/de/math/fibonacci

Use Cases

Educational demonstrations

Use the calculator to illustrate the Fibonacci sequence in math classes, showing how each term is the sum of the previous two and how the sequence grows.

Example: Show F(0) through F(10): 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55

Programming and algorithm testing

Developers can verify their own Fibonacci implementations or test algorithms that rely on large Fibonacci numbers, thanks to exact BigInt results.

Example: Check F(100) = 354224848179261915075

Frequently Asked Questions

What is the zero-based Fibonacci sequence?
In the zero-based system, the first term is F(0) = 0, the second is F(1) = 1, and each subsequent term is the sum of the two preceding ones. For example, F(2) = 1, F(3) = 2, F(4) = 3, and so on.
How does BigInt arithmetic improve Fibonacci calculations?
BigInt allows the calculator to handle arbitrarily large integers without overflow, so you can compute Fibonacci numbers with hundreds or thousands of digits exactly, which is impossible with standard floating-point numbers.
Can I generate a sequence of Fibonacci numbers?
Yes, you can generate a bounded sequence of Fibonacci numbers. Specify the starting index and the number of terms (or the ending index) to get a list of exact Fibonacci numbers within that range.

Tips & Common Mistakes

Tips

  • Remember that the sequence is zero-based: F(0) = 0, F(1) = 1. If you need the 10th term in the traditional one-based sense, enter 9.
  • For very large indices, the result will have many digits. Use the copy function to easily transfer the exact number.
  • When generating a sequence, ensure your start index is less than or equal to the end index to avoid an empty result.
  • Use the calculator to explore the golden ratio by dividing consecutive Fibonacci numbers – the ratio approaches approximately 1.618.

Common Mistakes to Avoid

  • Confusing zero-based indexing with one-based indexing, leading to off-by-one errors in the term value.
  • Assuming the calculator uses floating-point arithmetic, which would lose precision for large terms – but it uses BigInt for exact results.
  • Entering a negative index or a range where start > end, which may cause an error or unexpected output.

Last updated: August 13, 2026