The Kolakoski sequence digit distribution conjecture

About 15 years old · traced to

Let K=(Kn)n=1∞K=(K_n)_{n=1}^{\infty} be the classical Kolakoski sequence on the alphabet {1,2}\{\mathtt{1},\mathtt{2}\}, and let on=∣{i:Ki=1, 1≤i≤n}∣o_n=|\{i:K_i=\mathtt{1},\ 1\leq i\leq n\}| be the number of occurrences of 1\mathtt{1} among the first nn terms. Kolakoski digit distribution conjecture. The limit

lim⁡n→∞onn\lim_{n\to\infty}\frac{o_n}{n}

exists and equals 12\frac{1}{2}. This is a basic unresolved question about the digit distribution of the Kolakoski sequence; both the existence of the limit and its value remain open.

References

Primary source

Johan Nilsson, “A Space Efficient Algorithm for the Calculation of the Digit Distribution in the Kolakoski Sequence”, arXiv:1110.4228 (2012).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.