The 1st Fibonacci Number

The 1st Fibonacci number is 1. Index 1 is the first term the sequence actually produces, and one of two consecutive 1s. Together with F(2) it is the seed everything else grows from. It is one of the two values the sequence is seeded with rather than a sum of anything, which is why the rule only begi...

BY POSITION

WORTH TRYING

F(1)

1

RATIO TO F(0)

1 digit · previous 0 · next 1

Digits

1

Lucas L(n)

1

Sum of F(1)…F(n)

1

Ratio to previous

Exact in a double?

yes

Index n

1

AROUND F(1)

n

F(n)

DIGITS

0

0

1

1

1

1

2

1

1

3

2

1

4

3

1

STEPS

1

Every term is the sum of the two before it, starting from F(0) = 0 and F(1) = 1

2

F(1) is one of the two seed values, not a sum

3

1 digit, small enough to hold exactly in ordinary arithmetic

4

F(1) = 1

GOLDEN SPIRAL

SQUARE 1 OF 10 — SIDE 1RECTANGLE 1 × 1each square’s side is the next Fibonacci numberthe rectangle is always F(k) × F(k+1)

The squares build the sequence. Each new square takes the whole long side of what is already there, so its side is the sum of the two before it — which is the Fibonacci rule stated in geometry rather than arithmetic. The rectangle is always F(k) by F(k+1), and the quarter arcs join end to end into the spiral. It approaches the golden spiral without ever being one: this is built from circular arcs, and the true golden spiral is a smooth logarithmic curve. Square 1 is picked out in gold.

THE RATIO CLOSING ON φ

n = 3
2.00000000
n = 5
1.66666667
n = 8
1.61538462
n = 12
1.61797753
n = 20
1.61803396
n = 40
1.61803399

Bar length is the distance from φ = 1.618033989, so shorter is closer. The ratio alternates above and below it and the error falls by roughly a factor of φ² each step, which is why n = 40 already matches φ to the last digit a double can hold.

Exact, not floating point. F(78) is the last term that fits exactly in ordinary double arithmetic; F(79) is 14,472,334,024,676,221, which is past the limit. Everything here is computed with exact big integers, so F(500) is right to the final digit rather than rounded. Indices run to 1,000.

Live simulation · drawn to scale · updates as you type

Created with❤️byeaglecalculator.com

HOW TO USE

  1. 1

    The answer is already here: F(1) = 1. This page opens with index 1 loaded, so nothing needs typing.

  2. 2

    F(1) is a seed rather than a sum, so the STEPS panel says so instead of showing an addition.

  3. 3

    The six tiles carry the derived quantities — digit count, the Lucas number, the running total, the ratio to the previous term, and whether the value still fits exactly in ordinary computer arithmetic.

  4. 4

    Change the index to carry on, or switch to IS IT ONE? to test whether some other number appears in the sequence at all.

THE FORMULAS

The ruleF(n) = F(n−1) + F(n−2)
The seedsF(0) = 0, F(1) = 1
Golden ratioφ = (1 + √5) ÷ 2
Binet's formulaF(n) = (φⁿ − ψⁿ) ÷ √5
Ratio limitF(n) ÷ F(n−1) → φ
Sum of the first nF(1) + … + F(n) = F(n+2) − 1
Sum of squaresF(1)² + … + F(n)² = F(n)·F(n+1)
Cassini identityF(n)² − F(n−1)F(n+1) = (−1)ⁿ⁻¹
Greatest common divisorgcd(F(m), F(n)) = F(gcd(m,n))
Lucas numbersL(n) = F(n−1) + F(n+1)
Fibonacci test5N² ± 4 is a perfect square
Zeckendorfa unique sum of non-consecutive terms

FREQUENTLY ASKED QUESTIONS

RELATED CALCULATORS

MORE SEQUENCES CALCULATORS

Was this calculator helpful?

Last updated: July 29, 2026 · Formula verified · Exact big-integer arithmetic, so terms past F(78) are right to the final digit · Eagle-eyed accuracy for every calculation.