|
%I #17 Jul 25 2023 10:12:46
%S 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,
%T 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,
%U 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
%N Kolakoski-(2,3) sequence: a(n) is length of n-th run.
%H Ivan Neretin, <a href="/A071820/b071820.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.
%H Johan Nilsson, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL15/Nilsson/nilsson5.html">A Space-Efficient Algorithm for Calculating the Digit Distribution in the Kolakoski Sequence</a>, J. Int. Seq. 15 (2012) #12.6.7.
%H Ulrich Reitebuch, Henriette-Sophie Lipschütz, and Konrad Polthier, <a href="https://archive.bridgesmathart.org/2023/bridges2023-481.html">Visualizing the Kolakoski Sequence</a>, Bridges Conf. Proc.; Math., Art, Music, Architecture, Culture (2023) 481-484.
%t seed = {2, 3};
%t w = {};
%t i = 1;
%t Do[
%t w = Join[w,
%t Array[seed[[Mod[i - 1, Length[seed]] + 1]] &,
%t If[i > Length[w], seed, w][[i]]]];
%t i++
%t , {n, 43}];
%t w
%t (* _Ivan Neretin_, Apr 01 2015 *)
%Y Cf. A000002, A064353, A071907, A071928, A071942.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_
%E More terms from Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), Sep 08 2002
|
