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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A071820 Kolakoski-(2,3) sequence: a(n) is length of n-th run. 7
 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 2, 2, 3, 3, 2, 2, 3, 3, 3, 2, 2, 2, 3, 3, 3, 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 2, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 2, 2, 2, 3, 3, 2, 2, 3, 3, 3, 2, 2, 2, 3, 3, 2, 2, 3, 3, 2, 2, 2, 3, 3, 3, 2, 2, 2, 3, 3, 2, 2, 3, 3, 3, 2, 2, 2, 3, 3, 2, 2, 3, 3, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Ivan Neretin, Table of n, a(n) for n = 1..10000 Michael Baake and Bernd Sing, Kolakoski-(3,1) is a (deformed) model set, arXiv:math/0206098 [math.MG], 2002-2003. Johan Nilsson, A Space-Efficient Algorithm for Calculating the Digit Distribution in the Kolakoski Sequence, J. Int. Seq. 15 (2012) #12.6.7. Ulrich Reitebuch, Henriette-Sophie Lipschütz, and Konrad Polthier, Visualizing the Kolakoski Sequence, Bridges Conf. Proc.; Math., Art, Music, Architecture, Culture (2023) 481-484. MATHEMATICA seed = {2, 3}; w = {}; i = 1; Do[ w = Join[w, Array[seed[[Mod[i - 1, Length[seed]] + 1]] &, If[i > Length[w], seed, w][[i]]]]; i++ , {n, 43}]; w (* Ivan Neretin, Apr 01 2015 *) CROSSREFS Cf. A000002, A064353, A071907, A071928, A071942. Sequence in context: A271099 A344259 A165299 * A055092 A213202 A234972 Adjacent sequences: A071817 A071818 A071819 * A071821 A071822 A071823 KEYWORD nonn,easy AUTHOR N. J. A. Sloane EXTENSIONS More terms from Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Sep 08 2002 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 June 23 17:30 EDT 2024. Contains 373653 sequences. (Running on oeis4.)