This work presents the first 1001 Fibonacci numbers in a single, unadorned list. The sequence is defined by the recurrence F(n) = F(n-1) + F(n-2), with each term the sum of the two previous terms. The editor, Simon Plouffe, provides no commentary or analysis; the text is purely a numerical reference. The structure is minimal: a brief definition followed by the numbers themselves, each on its own line. This stark format emphasizes the raw data, allowing readers to observe patterns, growth rates, and the sheer scale of the sequence as it unfolds.

A Sequence Defined by Addition

The Fibonacci sequence is built from a simple rule: each term is the sum of the two preceding ones. The editor states this definition explicitly: “F(n) = F(n-1)+F(n-2), each term is the sum of the 2 previous terms.” This recurrence is the entire generative mechanism. The list begins with F(1)=1, F(2)=1, then proceeds: 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, and so on. The additive process quickly produces numbers that grow exponentially. By the 1001st term, the numbers have become astronomically large, yet they remain connected by the same elementary operation.

The Shape of the List

The text’s structure is a simple vertical enumeration. Each Fibonacci number is listed on its own line, with no additional formatting, tables, or indices. This flat presentation foregrounds the sequence’s monotonic increase. The absence of visual aids—no commas, no grouping, no scientific notation—forces the reader to confront the numbers in their full decimal length. As the digits accumulate, the list itself becomes a visual record of growth. The later entries stretch across the page, a physical manifestation of the sequence’s expansion.

Recurring Patterns in the Digits

Even without commentary, the list reveals recurring patterns. The last digits of Fibonacci numbers repeat every 60 terms, a cycle known as Pisano period modulo 10. Observant readers can spot this cycle: the final digits 1, 1, 2, 3, 5, 8, 3, 1, 4, 5, 9, 4, 3, 7, 0, 7, 7, 4, 1, 5, 6, 1, 7, 8, 5, 3, 8, 1, 9, 0, 9, 9, 8, 7, 5, 2, 7, 9, 6, 5, 1, 6, 7, 3, 0, 3, 3, 6, 9, 5, 4, 9, 3, 2, 5, 7, 2, 9, 1, 0 repeat. The list also shows that every third number is even, every fourth is a multiple of 3, and every fifth ends in 5. These patterns emerge from the additive rule itself.

The Editor’s Minimalist Approach

Simon Plouffe, an associate professor at LaCIM, University of Quebec at Montreal, is known for his work on mathematical constants and the Plouffe’s Inverter. In this edition, he provides only the definition and the list. There is no introduction, no historical context, no explanation of properties or applications. The text is a pure data set. This minimalism is a deliberate choice: it lets the numbers speak for themselves. For readers interested in the Fibonacci sequence as a mathematical object, this raw list is a resource for exploration, pattern-finding, and verification.

This edition is best approached as a reference or data source rather than a narrative. Readers may wish to scan the list for patterns, test conjectures, or simply observe the growth of the sequence. The lack of commentary means the work is open-ended: it invites independent discovery. For those studying modular arithmetic, digit patterns, or the distribution of prime factors, the list provides a foundation for hands-on investigation.