look-and-say
The look-and-say sequence (also called Conway's sequence) is generated by reading the previous term aloud: 1 β "one 1" β 11 β "two 1s" β 21 β "one 2, one 1" β 1211 β "one 1, one 2, two 1s" β 111221, and so on. Discovered popularly by John Conway. Each term grows in length, and Conway's cosmological theorem states the sequence eventually decomposes into 92 fundamental atoms. The ZTools Look and Say Generator computes the first N terms in the browser.
Use casesβ
Recreational math curiosityβ
See how a simple rule produces an unbounded growing sequence.
Teaching counting + grammarsβ
Visualise how recursive descriptions work.
Programming exerciseβ
Implementing look-and-say is a classic interview problem.
How it worksβ
- Pick start term β Default 1. Or any starting digit string.
- Pick term count β 1 to 30 typical. Beyond that, terms grow very long.
- Generate β For each term: walk runs of consecutive same digits, output count + digit.
Examplesβ
Input: First 6 terms
Output: 1, 11, 21, 1211, 111221, 312211.
Input: Term 10
Output: 13211311123113112211 β 20 chars; growth rate is Conway's constant ~1.303.
Frequently asked questionsβ
Conway's constant?
The ratio of consecutive term lengths approaches Ξ» β 1.303577... (root of a 71-degree polynomial). Each term is ~30% longer than the previous.
Cosmological theorem?
Conway proved every term eventually decomposes into 92 fundamental "atoms" that don't interact. Recreational math at its purest.
Privacy?
All in browser.
Tipsβ
- After ~25 terms, length exceeds millions of digits β display gets unwieldy.
- Try different starting digits (3, 5, 9) β different starting points lead to different sequences.
- Implement it yourself once β classic coding-interview question (group runs, format output).
Try it nowβ
The full look-and-say runs in your browser at https://ztools.zaions.com/look-and-say β no signup, no upload, no data leaves your device.
Last updated: 2026-05-06 Β· Author: Ahsan Mahmood Β· Edit this page on GitHub