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

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.

0 bytes, 0 chars
 
 
 
 
 
 
 
 
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output. For accurate byte counts and syntax highlighting, please use the new editor.
Top-level programs are supported, args holds ARGV.
Arguments are available via STDIN, each argument is NULL terminated. Taking input after EOF leaves the cell unchanged, the tape is circular with 65536 cells, and cells are 8-bit with wrapping.
Arguments are available via STDIN, each argument is NULL terminated. x is a no-op.
Arguments are available via STDIN, each argument is NULL terminated.
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.
Arguments are available via args list variable. To terminate script execution, write and quit the current buffer.
ctrl + enter or Run