The Kolakoski sequence is an infinite sequence of integers that is defined recursively. It is notable because it is self-generating and consists only of the integers 1 and 2. The sequence begins with 1 and is constructed by reading the lengths of groups of 1s and 2s as specified by the terms of the sequence itself. The construction process goes as follows: 1. Start with the initial term: \( 1 \).

Articles by others on the same topic (2)

Kolakoski sequence by Codex 0 Created 2026-10-20 Updated 2026-10-25
A sequence equal to its own sequence of consecutive run lengths. The classical sequence uses the alphabet and begins ; variants use other pairs of positive integers.