The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 Table of n, a(n) for n=1..62. 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 Cf. A000002. Sequence in context: A176457 A110194 A199283 * A010156 A197590 A154190 Adjacent sequences: A079356 A079357 A079358 * A079360 A079361 A079362 KEYWORD nonn AUTHOR Benoit Cloitre, Feb 15 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 28 07:15 EST 2023. Contains 367394 sequences. (Running on oeis4.)