login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A287066
Start with 1 and repeatedly substitute 0->01, 1->12, 2->0.
5
1, 2, 0, 0, 1, 0, 1, 1, 2, 0, 1, 1, 2, 1, 2, 0, 0, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 1, 0, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 1, 1, 2, 0, 0, 1, 0, 1, 1, 2, 0, 1, 1, 2, 1, 2, 0, 1, 2, 0, 0, 1, 1, 2, 0, 0, 1, 0, 1, 1, 2, 1, 2, 0, 0, 1, 0, 1, 1, 2, 0, 1, 1, 2, 1, 2, 0
OFFSET
1,2
COMMENTS
This is the fixed point of the morphism 0->01, 1->12, 2->0 starting with 1. Let u be the sequence of positions of 0, and likewise, v for 1 and w for 2. Let U, V, W be the limits of u(n)/n, v(n)/n, w(n)/n, respectively. Then 1/U + 1/V + 1/W = 1, where
U = 3.079595623491438786010417...,
V = 2.324717957244746025960908...,
W = U + 1 = 4.079595623491438786010417....
If n >=2, then u(n) - u(n-1) is in {1,2,3,4,6}, v(n) - v(n-1) is in {1,2,3,4}, and w(n) - w(n-1) is in {2,3,4,5,7}. For n >= 1, the number of terms resulting from n iterations of the morphism is A005251(n+2).
MATHEMATICA
s = Nest[Flatten[# /. {0 -> {0, 1}, 1 -> {1, 2}, 2 -> 0}] &, {1}, 10] (* A287066 *)
Flatten[Position[s, 0]] (* A287067 *)
Flatten[Position[s, 1]] (* A287068 *)
Flatten[Position[s, 2]] (* A287069 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Clark Kimberling, May 20 2017
STATUS
approved