Gijswijt’s Sequence
Details
Gijswijt’s sequence is a slow-growing sequence where each term counts the maximum number of repeated blocks of numbers in the sequence immediately preceding that term.
The sequence begins 1, 1, 2, 1, 1, 2, 2, 2, 3, 1 ... and its construction can be seen in the following figure.
[1] [1],[1] 1 , 1 ,[2] 1 , 1 , 2 ,[1] 1 , 1 , 2 ,[1],[1] [1 , 1 , 2],[1 , 1 , 2] 1 , 1 , 2 , 1 , 1 ,[2],[2] 1 , 1 , 2 , 1 , 1 ,[2],[2],[2] 1 , 1 , 2 , 1 , 1 , 2 , 2 , 2 ,[3] 1 , 1 , 2 , 1 , 1 , 2 , 2 , 2 , 3 , 1
On each line, the blocks that are used to get the next number in the sequence are marked in []. Print the first 1,000 terms of Gijswijt’s sequence, each on a separate line.
0 bytes, 0 chars
Restore solution
Compiled from
AT&T syntax to x86-64 Linux. Use
syscalls to write output.
Fennel is an experimental language, no solutions will be saved.
Please leave feedback on the
GitHub issue.
ctrl + enter or