# Talk:Kolakoski sequence

## Definition of Kolakoski sequence

The wikipedia entry referred to in the task description defines the Kolakoski sequence as "In mathematics, the Kolakoski sequence, sometimes also known as the Oldenburger–Kolakoski sequence, is an infinite sequence of symbols {1,2} that is the sequence of run lengths in its own run-length encoding". The task description defines it as "The Kolakoski sequence is an infinite sequence of natural numbers, (excluding zero); with the property that if you form a new sequence from the counts of runs of the same number in the first sequence, this new sequence is the same as the first sequence". The task description should state that this task is a generalization of the Kolakoski sequence or point to some other reference. It should not claim that there are rules on wikipedia for generating Kolakoski sequences which are broken by (1, 3, 2, 1) as this would not be a valid seed as defined by wikipedia. --Nigel Galloway (talk) 13:39, 30 July 2024 (UTC)