Fibonacci Sequence

Explore the Fibonacci sequence 0, 1, 1, 2, 3, 5, 8, 13 …, in which each term is the sum of the two before it. Look up any term F(n) for n up to 100,000, worked out exactly with whole-number (BigInt) arithmetic (F(100,000) has 20,899 digits), and download the first 1,000 terms with the Lucas numbers as CSV. Chart the ratio of each term to the one before and watch it close in on the golden ratio phi, for the Fibonacci numbers, the Lucas numbers or two starting numbers of your own. Print the classic tiling of squares whose sides are the Fibonacci numbers, with a quarter circle in each square, as a PDF, a 300 DPI PNG or an SVG. Nothing is uploaded.

100% private — everything runs in your browser. Everything runs in your browser; nothing is uploaded.

100% private — runs in your browser

Print at 100% (Actual size). Real size prints on one sheet when the drawing fits; the check bar in the footer lets you confirm the scale. The SVG holds the drawing at the printed size. The CSV holds F(0) onwards with its digit count and the Lucas number (and your own sequence when you set one).

Fibonacci sequence

Exact terms

Look

Page

Runs in your browser with our own code: nothing you type is uploaded or saved. Every term is an exact whole number (BigInt), added up from the two before it, and every square, arc and ratio is drawn from those same terms. You may use what you make here, including commercially, with no credit needed.

How to explore the Fibonacci sequence

  1. Pick a preset, or choose the square tiling or the ratio chart.
  2. Set the number of squares (2 to 24), or the number of terms and the sequence for the chart.
  3. Type n to look up F(n), and choose how many terms go in the CSV.
  4. Choose the colours, arcs, labels and Fitted to one page or Real size.
  5. Download the PDF and print at 100% (Actual size), or the PNG, SVG or CSV.

What you can use it for

  • Looking up any Fibonacci number exactly
  • Lists of terms for spreadsheets and code tests
  • Lessons on the golden ratio and convergence
  • Square-tiling posters and line art
  • Plotter and laser art from the SVG
  • Trying sequences with your own starting numbers

The 16 presets

PresetShowsLook-up
Squares 1 to 55 with arcs10 squares, largest 55F(100): 21 digits
Squares 1 to 21, labelled8 squares, largest 21F(100): 21 digits
Squares 1 to 14412 squares, largest 144F(100): 21 digits
Squares 1 to 987 (16 squares)16 squares, largest 987F(100): 21 digits
Squares only, no arcs10 squares, largest 55F(100): 21 digits
Arcs only, no fill12 squares, largest 144F(100): 21 digits
Squares 1 to 89, warm colours11 squares, largest 89F(100): 21 digits
Squares 1 to 34, browns9 squares, largest 34F(100): 21 digits
Ratios F(n + 1) / F(n) approach phiFibonacci, 30 ratiosF(100): 21 digits
Ratios, first 12 termsFibonacci, 12 ratiosF(100): 21 digits
Lucas number ratiosLucas, 30 ratiosF(100): 21 digits
F(1,000): exact, 209 digits10 squares, largest 55F(1,000): 209 digits
F(10,000): exact, 2,090 digits12 squares, largest 144F(10,000): 2,090 digits
F(100,000): exact, 20,899 digits14 squares, largest 377F(100,000): 20,899 digits
Your own start: 3, 7, 10, 17 … ratiosstart 3, 7, 25 ratiosF(100): 21 digits
Real size: 1 = 2 mm, squares to 5510 squares, largest 55F(100): 21 digits

Every value is worked out by the tool.

The first 31 terms

nF(n)Lucas L(n)F(n + 1) / F(n)
002–
1111
2132
3241.5
4371.6666666667
55111.6
68181.625
713291.6153846154
821471.619047619
934761.6176470588
10551231.6181818182
11891991.6179775281
121443221.6180555556
132335211.6180257511
143778431.6180371353
156101,3641.6180327869
169872,2071.6180344478
171,5973,5711.6180338134
182,5845,7781.6180340557
194,1819,3491.6180339632
206,76515,1271.6180339985
2110,94624,4761.618033985
2217,71139,6031.6180339902
2328,65764,0791.6180339882
2446,368103,6821.618033989
2575,025167,7611.6180339887
26121,393271,4431.6180339888
27196,418439,2041.6180339887
28317,811710,6471.6180339888
29514,2291,149,8511.6180339887
30832,0401,860,4981.6180339888

Big terms

nDigits in F(n)F(n)
10255
10021354,224,848,179,261,915,075
1,0002094346655768…6849228875
10,0002,0903364476487…9947366875
100,00020,8992597406934…3428746875

Exact, by fast doubling; long values show the first and last digits.

Binet’s formula: φ^n / √5 rounds to F(n)

nF(n)φ^n / √5Rounds to F(n)
554.959675yes
105555.003636yes
206,7656765.00003yes
30832,040832040yes
40102,334,155102334155yes
5012,586,269,02512586269025.000019yes
601,548,008,755,9201548008755920.00293yes
70190,392,490,709,135190392490709135.4375yes

Sums of terms and of squares

nF(1) + … + F(n)EqualsF(1)² + … + F(n)²Equals
512F(7) − 140F(5) × F(6)
10143F(12) − 14,895F(10) × F(11)
2017,710F(22) − 174,049,690F(20) × F(21)
5032,951,280,098F(52) − 1256,319,508,074,468,182,850F(50) × F(51)

The square tiling

SquaresLargest sideRectangleLong side / short side
322 × 31.5
555 × 81.6
82121 × 341.61904762
105555 × 891.61818182
12144144 × 2331.61805556
16987987 × 1,5971.61803445
206,7656,765 × 10,9461.618034
2446,36846,368 × 75,0251.61803399

The rectangle’s proportions approach φ as squares are added.

What prints

DownloadWhat is in it
PDFThe square tiling or the ratio chart fitted to one page or at real size, vector squares, arcs and labels, with the sizes and a check bar
PNG 300 DPIThe same sheet as a picture
SVGThe drawing at the printed size: squares as rectangles, arcs as paths, labels as text
CSVF(n), digits, L(n) (and your own sequence) for n from 0

For a cutter that needs DXF, use SVG to DXF; to work with φ in a layout, use the Golden Ratio Calculator.

Which tool to use

You wantUse
Exact Fibonacci terms, ratios and the square tilingFibonacci Sequence (this page)
A spiral template to lay over a photo or layoutGolden Spiral
Golden-ratio proportions for a designGolden Ratio Calculator, Golden Rectangle
Fibonacci numbers inside Pascal’s trianglePascal’s Triangle

Other tools: the Golden Ratio Calculator splits lengths by φ, the Logo Grid Generator builds golden-ratio circle grids and the Spiral Art Generator draws other spirals.

More free tools

Maths art, patterns and printables?

Drawing and print tools that run privately in your browser, with no sign-up and no watermark.

See all free tools →

Frequently asked questions

What is the Fibonacci sequence?

The sequence that starts 0, 1 and then adds the two previous terms to get the next: 0, 1, 1, 2, 3, 5, 8, 13, 21, 34 … We write F(0) = 0, F(1) = 1 and F(n) = F(n − 1) + F(n − 2).

Who was Fibonacci?

Leonardo of Pisa, known as Fibonacci, who introduced the sequence to Western European mathematics in his 1202 book Liber Abaci. It had been described much earlier in Indian mathematics, as early as 200 BC in work by Pingala on patterns in Sanskrit poetry (Wikipedia, Fibonacci sequence, read 13 November 2026).

How big can n be?

Up to 100,000. Every term is exact: the tool uses BigInt whole numbers and the fast-doubling formulas F(2k) = F(k) (2 F(k + 1) − F(k)) and F(2k + 1) = F(k)² + F(k + 1)², which our tests check against adding the terms one by one up to F(10,000). F(100,000) has 20,899 digits; the box under the drawing holds every digit.

What is the golden ratio phi?

φ = (1 + √5) / 2 = 1.618033988750… The ratio of each Fibonacci number to the one before, 1/1, 2/1, 3/2, 5/3, 8/5 …, gets closer and closer to φ, landing alternately below and above it. From n = 40 on, the ratio is within 0.000000000000001 of φ (our tests check this).

What is Binet’s formula?

A closed form for the terms: F(n) = (φ^n − (−1/φ)^n) / √5. Because the second part shrinks quickly, F(n) is simply φ^n / √5 rounded to the nearest whole number. The table below checks this up to n = 70; beyond that, ordinary floating-point numbers are not precise enough, which is why the tool uses exact whole numbers instead.

What are the Lucas numbers?

The same rule with a different start: 2, 1, 3, 4, 7, 11, 18 … Each Lucas number is the sum of the two Fibonacci numbers either side of the same place, L(n) = F(n − 1) + F(n + 1), which our tests check. Their ratios approach φ as well.

Can I use my own starting numbers?

Yes: choose Your own two starting numbers and type a(0) and a(1), up to 30 digits each. Any start (other than two zeros) whose terms do not hit 0 gives ratios that approach φ too; the CSV adds your sequence as a column.

How does the square tiling work?

Start with two 1 × 1 squares side by side, then keep adding a square on the long side of the rectangle so far: 2, then 3, 5, 8 … Each new square’s side is the next Fibonacci number, and the squares always make a rectangle F(N) × F(N + 1). The quarter circle in each square joins the next one, making a spiral of arcs. Our tests check every side, that no squares overlap and that the arcs join.

Some sums worth knowing

The first n Fibonacci numbers add up to F(n + 2) − 1, and their squares add up to F(n) × F(n + 1), which is the area of the square tiling. The table below checks both for several n.

What is in the CSV?

For each n from 0: F(n), its number of digits, the Lucas number L(n), and your own sequence if you set one. Up to 1,000 terms.

Can it print at real size?

Yes, when the drawing fits on one sheet: choose Real size and set the size. Every printed cell, square and line is within 0.2 mm of its true place in our tests, on US Letter and A4, as long as you print at 100% (Actual size); the check bar in the footer lets you confirm the scale. Bigger drawings print fitted to the page.

Is it free?

Yes. There is no sign-up, no watermark and no limit.

Is anything uploaded?

No. Every number is worked out by JavaScript in your browser. Nothing you type is sent anywhere or saved when you close the page.