&gt;Can&#x27;t you trivially force this to happen for any sequence?No, because there&#x27;s no deterministic way to infinitely extend that sequence. In your first example:<pre><code> 1 3 3 3 2 2 2 1 1 1 4 4 x x y y
 1 3---- 3---- 3---- 2-- 2-- 2--
</code></pre>
What are the values of x and y?&gt;Whenever you start a new count, choose a random number and repeat for a many times as needed for the trailing sequence to match the top sequence.You answered your own question. The Kolakoski sequence is special because it does not just pick a random number: the sequence is deterministically encoded by the run lengths, and vice versa.

Can&#x27;t you trivially force this to happen for any sequence?1, 3, 3, 3, 2, 2, 2, 1, 1, 1, 4, 4,Goes to1, 3, 3, 3, 2... Etc.I could extend this trivially too since the bottom sequence trails the sequence we write up top. If i wanted another &#x27;2&#x27; down the bottom whatever number i choose up top i just write twice right?So there&#x27;s nothing about this particular sequence? I can just create any such sequences trivially; Whenever you start a new count, choose a random number and repeat for a many times as needed for the trailing sequence to match the top sequence.It seems that this particular variant is uninteresting in the broader picture right? I could write another similar one2, 2, 1, 1, 2, 12, 2, 1, 1, ... etc.I don&#x27;t get the specialness here?

For those not getting this immediately (I sure didn&#x27;t):<pre><code> _____________
 sequence 1 2 2 1 1 2 1 2 2 1
 run lens 1 2-- 2-- 1 1 2-- 1
</code></pre>
Read out the bottom sequence of run lengths, and be amazed that it&#x27;s the same as the first 7 digits as the top sequence. Extend the bottom to continue to recapitulate the top sequence, and add terms to the top sequence accordingly to reflect the run lengths in the bottom sequence. Repeat infinitely.

There&#x27;s a fascinating way to generate the Kolakoski sequence with bit fiddling: <a href="https:&#x2F;&#x2F;11011110.github.io&#x2F;blog&#x2F;2016&#x2F;10&#x2F;14&#x2F;kolakoski-sequence-via.html" rel="nofollow">https:&#x2F;&#x2F;11011110.github.io&#x2F;blog&#x2F;2016&#x2F;10&#x2F;14&#x2F;kolakoski-sequenc...</a>

Is it a coincidence that it is number 2 in the OEIS?)

does it repeat? or is it like pi? -- oh the wiki says its an infinite sequence. that might be handy for generating pseudo random numbers i guess. i wonder if theres a function that generates the correct digit at position n? doh, wiki says theres a recursive formula for the i&#x27;th term.

Kolakoski Sequence