Fibonacci Words Generator

The Fibonacci word sequence replaces the numbers of the Fibonacci recurrence with text: choose two seed words, then let every later word be the concatenation of the two before it. The classic seeds "0" and "01" yield 0, 01, 010, 01001, 01001010, 0100101001001... — lengths that march through the Fibonacci numbers while the patterns of the words hide a Sturmian structure that pure digits do not.

Fibonacci Words Generator builds the sequence to any term count you choose, with editable seeds. Each row shows the index, a preview, and the exact character count; the Copy and Download actions export the full words. Everything is assembled locally — no upload, no server visit, instant output.

• Sequence construction: W(n) = W(n-1) + W(n-2) applied from your two seeds, term by term.
• Editable seeds: Any two strings — digits, letters or phrases — define a valid Fibonacci word run.
• Length tracking: Every term reports its exact character count, making the Fibonacci growth of lengths visible.
• Truncated previews: Huge words display the first 90 characters with a remainder count instead of flooding the page.
• Full export: Copy or download the complete words, protected by a 600,000-character safety cap with a clear note if it engages.
• Reference tab: The classic words, the morphism that generates the infinite limit, and the Sturmian properties that make the word famous.
• Free and private: Local concatenation only — nothing is uploaded, stored or logged.

1. Set the term count — how many words, from the seeds upward (1 to 25).
2. Edit the seeds — the comma-separated W0 and W1, e.g. "0, 01" for the classic run.
3. Generate — rows appear with index, preview and character count.
4. Watch the growth — term 10 is 89 characters; the lengths climb through the Fibonacci numbers.
5. Copy or download — the complete untruncated sequence for study or reuse.

Example 1 — The classic run. Seeds "0, 01" with 8 terms give 0, 01, 010, 01001, 01001010, 0100101001001, and two longer members. The lengths are 1, 2, 3, 5, 8, 13, 21, 34 — the Fibonacci numbers.

Example 2 — An alphabet convention. Seeds "a, ab" produce the alphabetical Fibonacci words a, ab, aba, abaab... of the same lengths, ready for linguistic analysis.

Example 3 — A phrase pair. Seeds "red, blue" give red, blue, redblue, blueredblue — proof that the recurrence composes any two strings.

Example 4 — Check self-similarity. Generate 10 terms and observe that every word starts with the previous word: W(9) begins with W(8), making the gradual approach to the infinite Fibonacci word visible.

Example 5 — The morphism shortcut. Use seeds "01, 0" — the image of the morphism 0→01, 1→0 applied step by step — and notice the sequence arrives at the same family of words in the other order.

• Instant construction: Any depth of the sequence in a single click, with no typing of repeated concatenations.
• Seed freedom: Digits, letters or entire phrases — the recurrence does not care what the text is.
• Growth visible: Exact per-term character counts demonstrate Fibonacci growth without any calculation on your part.
• Safe for big runs: Preview truncation and a copy-buffer cap keep even 196,000-character terms usable.
• Study-ready export: One click downloads the full sequence for algorithms, teaching or papers.
• Private by design: All concatenation happens in the browser; nothing leaves your machine.