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) output the first 1000 elements in the Kolakoski sequence, separated by spaces.

All
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
Top-level programs are supported, args holds ARGV.
ARGV is available via STDIN, joined on NULL. x is a no-op.
ARGV is available via STDIN, joined on NULL.
arguments holds ARGV, print() to output with a newline, write() to output without a newline.
say() is available without any import.
$args to access the arguments.
SELECT arg FROM argv to access the arguments, only the first column of the first result set will be printed, NULL values will be skipped, and the dialect is SQLite.
ctrl + enter or Run