|
%I #17 Nov 30 2016 12:33:22
%S 2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1,2,1,1,2,1,2,2,1,1,2,1,1,2,1,2,
%T 2,1,2,2,1,1,2,1,2,2,1,2,1,1,2,1,1,2,2,1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,
%U 1,1,2,1,2,2,1,2,1,1,2,2,1,2,2,1,1,2,1,2,2,1,2,2,1,1,2,1,1,2,2,1,2,1,1,2,1
%N The sequence starting with 2 that equals its own run length sequence.
%C It is an unsolved problem to show that the density of 1's is equal to 1/2.
%C The sequence can be generated by starting with 22 and applying the block-substitution rules 22 -> 2211, 21 -> 221, 12 -> 211, 11 -> 21. (Lagarias)
%D M. S. Keane, Ergodic theory and subshifts of finite type, Chap. 2 of T. Bedford et al., eds., Ergodic Theory, Symbolic Dynamics and Hyperbolic Spaces, Oxford, 1991, esp. p. 50.
%H Ivan Neretin, <a href="/A078880/b078880.txt">Table of n, a(n) for n = 1..10000</a>
%H J.-M. Fedou, G. Fici, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL13/Fici/fici.html">Some remarks on differentiable sequences and recursivity</a>, JIS 13 (2010) # 10.3.2.
%F a(n) = k(n+1), where k=A000002, the Kolakoski sequence.
%e Start with 2, which generates 22 (so that the first run length is 2); then 22 generates 2211 (so that the first two run lengths are 2 and 2); then 2211 generates 221121 and so on.
%t seed = {2, 1}; w = {}; i = 1; Do[w = Join[w, Array[seed[[Mod[i - 1, Length[seed]] + 1]] &, If[i > Length[w], seed, w][[i]]]]; i++, {n, 70}]; w (* _Ivan Neretin_, Apr 02 2015 *)
%Y See A000002, this sequence prepended with 1, for properties, formulas, references, links, programs, etc.
%K nonn
%O 1,1
%A _Clark Kimberling_, Dec 11 2002
|
