|
|
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
|
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
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Sep 08 2002
|
|
STATUS
|
approved
|
|
|
|