A106687 Limiting word of the substitution 1->{2}, 2->{3}, 3->{4}, 4->{5}, 5->{6}, 6->{1, 2, 3, 4, 5, 6} with axiom 1.

6, 1, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 4, 5, 6, 1, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 5, 6, 1, 2, 3, 4, 5, 6, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 6, 3, 4, 5, 6, 1, 2

Offset

0,1

Links

Table of n, a(n) for n=0..104.

Mathematica

s[1] = {2}; s[2] = {3}; s[3] = {4}; s[4] = {5}; s[5] = {6}; s[6] = {1, 2, 3, 4, 5, 6};
t[a_] := Flatten[s /@ a];
p[0] = {1}; p[1] = t[p[0]]; p[n_] := t[p[n - 1]]
aa = p[11]

Crossrefs

Sequence in context: A164809 A089128 A222215 * A083463 A187110 A378994

Adjacent sequences: A106684 A106685 A106686 * A106688 A106689 A106690

Keyword

nonn,easy,less

Author

Roger L. Bagula, May 13 2005

Status

approved