A269351 Kolakoski-(1,9) sequence: a(n) is length of n-th run.

1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 9, 1, 9

Offset: 1

Author

Vincenzo Librandi, Mar 02 2016

Keywords

• nonn
• easy

Comments

19, 199, 1999, 199999, 19999999, 1999999999111111111999999999111111111999999999 are primes.

Links

• Vincenzo Librandi, 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.

Crossrefs

Cf. similar sequences listed in A269268.

Programs

Mathematica

seed = {1, 9}; w = {}; i = 1; Do[w = Join[w, Array[seed[[Mod[i - 1, Length[seed]] + 1]]&, If[i > Length[w], seed, w][[i]]]]; i++, {n, 42}]; w