|
|
A079359
|
|
Iterate the process: "sum of terms of n-th run" on the Kolakoski sequence until all runs have length 1.
|
|
0
|
|
|
1, 8, 1, 4, 1, 4, 6, 4, 1, 6, 1, 4, 8, 1, 4, 1, 8, 1, 4, 1, 8, 4, 1, 8, 1, 4, 8, 1, 4, 1, 8, 1, 8, 1, 4, 1, 4, 6, 4, 1, 6, 1, 4, 1, 4, 8, 1, 4, 6, 4, 1, 8, 4, 1, 8, 1, 4, 1, 8, 1, 4, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Is it enough to apply the process three times only to obtain all runs of length 1? Then all terms should have values among 1,4,6 or 8.
|
|
LINKS
|
|
|
EXAMPLE
|
Kolakoski sequence begins 1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2, When process is applied once: 1,2+2,1+1,2,1,2+2,1,2+2, --> 1,4,2,2,1,4,1,4,...Twice: 1,4,2+2,1,4...->1,4,4,1,4 ... Three times -> 1,8,1,4...
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|