|
%I #14 Mar 04 2016 02:30:13
%S 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,
%T 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,
%U 1,1,1,1,1,9,9,9,9,9,9,9,9,9,1,9,1,9
%N Kolakoski-(1,9) sequence: a(n) is length of n-th run.
%C 19, 199, 1999, 199999, 19999999, 1999999999111111111999999999111111111999999999 are primes.
%H Vincenzo Librandi, <a href="/A269351/b269351.txt">Table of n, a(n) for n = 1..10000</a>
%H Michael Baake and Bernd Sing, <a href="http://arXiv.org/abs/math.MG/0206098">Kolakoski-(3,1) is a (deformed) model set</a>, arXiv:math/0206098 [math.MG], 2002-2003.
%t 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
%Y Cf. similar sequences listed in A269268.
%K nonn,easy
%O 1,2
%A _Vincenzo Librandi_, Mar 02 2016
|
