Tribonacci Words Generator

The tribonacci word sequence is the ternary counterpart of the Fibonacci words: three seed words open the run, and every later word concatenates the three before it. The classic seeds "0", "01" and "012" produce 0, 01, 012, 012010, 01201001201... — words whose character counts are the tribonacci numbers 1, 2, 3, 6, 11, 20, 37... The recurrence that once produced numbers now produces text, with the same famous growth rate, about 1.8393 per term.

Tribonacci Words Generator builds the run to any term count up to 25 with fully editable seeds. Each row reports index, preview and exact length; Copy and Download export the complete words. All concatenation happens locally in your browser.

• Sequence construction: W(n) = W(n-1) + W(n-2) + W(n-3) applied term by term from your three seeds.
• Editable seeds: Any three strings define a valid run — digits, letters or phrases.
• Tribonacci growth on display: Per-term character counts follow the tribonacci numbers exactly.
• Safe previews: Terms past 90 characters are truncated with a remainder count, keeping big runs readable.
• Full export: Copy or download the complete words with a clear 600,000-character safety cap.
• Reference tab: The classic ternary words, the morphism and the golden-ratio-like constant behind the growth.
• Free and private: All assembly happens in the browser — 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 — three comma-separated words; the defaults are "0, 01, 012".
3. Generate — rows appear with index, preview and character count.
4. Follow the lengths — 1, 2, 3, 6, 11, 20... the tribonacci numbers in plain sight.
5. Copy or download — the complete sequence for teaching, analysis or algorithms.

Example 1 — The classic run. Seeds "0, 01, 012" with 7 terms give the words 0, 01, 012, 012010, 01201001201, and two longer members, with lengths 1, 2, 3, 6, 11, 20, 37.

Example 2 — Alphabet variant. Seeds "a, ab, abc" produce a, ab, abc, abcabac, abcabacabcab... the same recurrence in three letters.

Example 3 — Pure repetition. Seeds "X, X, X" give the constant word run X, X, X, XXX, XXXXXX, XXXXXXXXXXX — lengths 1, 1, 1, 3, 6, 11... proving seeds do not need to differ.

Example 4 — Self-similarity check. Generate 10 terms and note that each word begins with the previous one: W(9) starts with W(8), W(8) with W(7), the prefix chain the limit word inherits.

Example 5 — The morphism step. Set seeds to the images of the tribonacci morphism ("01", "02", "0") and compare with the classic run — the same family, reordered by the substitution rule.

• Instant construction: A full ternary word run in one click, no manual concatenation.
• Seed freedom: Any three strings — the recurrence never cares about the alphabet.
• Growth visible: Exact character counts trace the tribonacci numbers term by term.
• Handles the explosion: 90-character previews and a 600,000-char export cap keep billion-character territory usable.
• Teaching-friendly: The morphism connection is documented in the Reference tab, not just computed.
• Private by design: Words never leave the browser; nothing is uploaded or logged.