A071942 Kolakoski-(3,4) sequence: a(n) is length of n-th run.

3, 3, 3, 4, 4, 4, 3, 3, 3, 4, 4, 4, 4, 3, 3, 3, 3, 4, 4, 4, 4, 3, 3, 3, 4, 4, 4, 3, 3, 3, 4, 4, 4, 4, 3, 3, 3, 3, 4, 4, 4, 4, 3, 3, 3, 3, 4, 4, 4, 3, 3, 3, 4, 4, 4, 3, 3, 3, 4, 4, 4, 4, 3, 3, 3, 3, 4, 4, 4, 4, 3, 3, 3, 3, 4, 4, 4, 3, 3, 3, 4, 4, 4, 3, 3, 3, 3, 4, 4, 4, 4, 3, 3, 3, 3, 4, 4, 4, 3, 3, 3, 4, 4, 4, 3

Offset: 1

Author

N. J. A. Sloane

Keywords

• nonn
• easy

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.

Crossrefs

Cf. A000002, A071820, A071907, A071928, A064353.

Programs

Mathematica

seed = {3, 4}; w = {}; i = 1; Do[w = Join[w,Array[seed[[Mod[i - 1, Length[seed]] + 1]] &, If[i > Length[w], seed, w][[i]]]]; i++, {n, 31}]; w (* Ivan Neretin, Apr 02 2015 *)

Extensions

More terms from Benoit Cloitre, Feb 17 2003