Please in order to save solutions and appear on the leaderboards.

Kolakoski Sequence

Details

The Kolakoski sequence is a self referential sequence where the nth element is the length of the nth run of same numbers in the sequence. This has the interesting property where if you take the run lengths of this sequence, then you will get the same sequence back again. For example, the sequence starting with (1, 2) looks like:

    1 2 2 1 1 2 1 2 2 1 2 2 1 1 2 1 1 2 2 1 2 1 1 2 1…
    1  2   2  1 1  2  1  2   2  1  2   2  1 1  2  1 1…

Beginning with (1, 2) print the first 1,000 elements in the Kolakoski sequence, separated by spaces.

0 bytes, 0 chars
Restore solution
All
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
TeX is an experimental language, no solutions will be saved. Please leave feedback on the GitHub issue.
ctrl + enter or

Delete Solution

Are you sure you want to delete your solution(s) for Kolakoski Sequence?

If you have seperate bytes and chars solutions then both will be deleted.

This is irreversible, please backup any code you care about.

Type I understand and press confirm to continue.