OFFSET
1
COMMENTS
From Danny Rorabaugh, Mar 14 2015: (Start)
Let x(i) and y(i) be the number of 0's and 1's, respectively, after the i-th stage of generating this word, so x(0) = 1, y(0) = 0, x(i+1) = x(i) + y(i), and y(i+1) = 2x(i) + y(i). Equivalently: x(0) = 1, x(1) = 1, x(i+2) = 2x(i+1) + x(i), y(0) = 0, y(1) = 2, and y(i+2) = 2y(i+1) + y(i).
The number of 0's after the i-th stage is x(i) = A001333(i).
The number of 1's after the i-th stage is y(i) = 2*A000129(i) = A163271(i+1) = A001333(i+1) - A001333(i).
Let S(n) = Sum_{j<=n} a(j) be the partial sums of this sequence, so S(x(i)+y(i)) = y(i). Consequently, if the Cesàro sum of a(n) exists, then it is lim_{n->infinity} S(n)/n = lim_{i->infinity} A163271(i+1)/A001333(i+1) = 2 - sqrt(2).
(End)
The Cesàro sum of (a(n)) DOES exist. It is well known that the frequencies of letters exist in sequences generated by (primitive) morphisms. The frequencies are given by the normalized right eigenvector (belonging to the Perron-Frobenius eigenvalue) of the incidence matrix of the morphism. - Michel Dekking, Feb 02 2017
REFERENCES
Martine Queffélec, Substitution dynamical systems—spectral analysis, 2nd ed., Lecture Notes in Mathematics, vol. 1294, Springer-Verlag, Berlin, 2010.
LINKS
Wieb Bosma, Michel Dekking, Wolfgang Steiner, A remarkable sequence related to Pi and sqrt(2), arXiv:1710.01498 [math.NT], 2017.
Wieb Bosma, Michel Dekking, Wolfgang Steiner, A remarkable sequence related to Pi and sqrt(2), Integers, Electronic Journal of Combinatorial Number Theory 18A (2018), #A4.
EXAMPLE
0->011->0110101->01101010110101101->
MATHEMATICA
t = Nest[Flatten[# /. {0->{0, 1, 1}, 1->{0, 1}}] &, {0}, 5] (*A189687*)
f[n_] := t[[n]]
Flatten[Position[t, 0]] (* A086377 conjectured *)
Flatten[Position[t, 1]] (* A081477 conjectured *)
s[n_] := Sum[f[i], {i, 1, n}]; s[0] = 0;
Table[s[n], {n, 1, 120}] (*A189688*)
SubstitutionSystem[{0->{0, 1, 1}, 1->{0, 1}}, {0}, {6}][[1]] (* Harvey P. Dale, Jan 20 2024 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Apr 25 2011
STATUS
approved