|
| |
|
|
A106826
|
|
Trajectory of 1 under the morphism 1->{2,1}, 2->{2,3}, 3->{4,3}, 4->{4,1}.
|
|
0
| |
|
|
2, 3, 4, 3, 4, 1, 4, 3, 4, 1, 2, 1, 4, 1, 4, 3, 4, 1, 2, 1, 2, 3, 2, 1, 4, 1, 2, 1, 4, 1, 4, 3, 4, 1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, 2, 3, 2, 1, 4, 1, 2, 1, 2, 3, 2, 1, 4, 1, 2, 1, 4, 1, 4, 3, 4, 1, 2, 1, 2, 3, 2, 1, 2, 3, 4, 3, 2, 3, 2, 1, 2, 3, 4, 3, 4, 1, 4, 3, 2, 3, 4, 3, 2, 3, 2, 1, 4, 1, 2, 1, 2, 3, 2, 1, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,1
|
|
|
COMMENTS
| This is the reverse of the morphism in A105500 and the trajectory of 1 actually starts with 2 instead of 1.
|
|
|
REFERENCES
| F. M. Dekking, Recurrent sets, Advances in Mathematics, 44 (1982), 78-104.
|
|
|
MATHEMATICA
| Nest[ Flatten[ # /. {1 -> {2, 1}, 2 -> {2, 3}, 3 -> {4, 3}, 4 -> {4, 1}}] &, {1}, 8] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 20 2005)
|
|
|
PROG
| (PARI) {a(n)=local(A); if(n<0, 0, n++; A=[2]; while(length(A)<n, A=concat(vector(length(A), k, [[2, 1], [2, 3], [4, 3], [4, 1]][A[k]]))); A[n])}
|
|
|
CROSSREFS
| Cf. A105500.
Sequence in context: A204932 A079086 A017839 * A139048 A158515 A123709
Adjacent sequences: A106823 A106824 A106825 * A106827 A106828 A106829
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 20, 2005
|
| |
|
|
