|
| |
|
|
A026600
|
|
a(n) is the n-th letter of the infinite word generated from w(1)=1 inductively by w(n)=JUXTAPOSITION{w(n-1),w'(n-1),w"(n-1)}, where w(k) becomes w'(k) by the cyclic permutation 1->2->3->1 and w"(k) = (w')'(k).
|
|
16
| |
|
|
1, 2, 3, 2, 3, 1, 3, 1, 2, 2, 3, 1, 3, 1, 2, 1, 2, 3, 3, 1, 2, 1, 2, 3, 2, 3, 1, 2, 3, 1, 3, 1, 2, 1, 2, 3, 3, 1, 2, 1, 2, 3, 2, 3, 1, 1, 2, 3, 2, 3, 1, 3, 1, 2, 3, 1, 2, 1, 2, 3, 2, 3, 1, 1, 2, 3, 2, 3, 1, 3, 1, 2, 2, 3, 1, 3, 1, 2, 1, 2, 3, 2, 3, 1, 3, 1, 2, 1, 2, 3, 3, 1, 2, 1, 2, 3, 2, 3, 1, 1, 2, 3, 2, 3, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
LINKS
| Michael Gilleland, Some Self-Similar Integer Sequences
|
|
|
FORMULA
| a(A026601(n)) = 1. a(A026602(n)) = 2. a(A026603(n)) = 3. - Michael Somos Sep 06 2008
|
|
|
MATHEMATICA
| Nest[ Flatten[ # /. {1 -> {1, 2, 3}, 2 -> {2, 3, 1}, 3 -> {3, 1, 2}}] &, {1}, 7] (from Robert G. Wilson v Mar 08 2005)
|
|
|
PROG
| (PARI) {a(n) = if( n<2, n>0, (a((n + 2)\ 3) + n + 1 )%3 + 1)} /* Michael Somos Sep 06 2008 */
|
|
|
CROSSREFS
| Equals A053838(n-1) + 1. Cf. A026601-A026614.
Sequence in context: A197262 A085032 A004549 * A106560 A202495 A103431
Adjacent sequences: A026597 A026598 A026599 * A026601 A026602 A026603
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu)
|
| |
|
|
