|
Search: id:A106824
|
|
|
| A106824 |
|
Trajectory of 1 under the morphism 1->13, 2->13223, 3->1323. |
|
+0
1
|
|
| 1, 3, 1, 3, 2, 3, 1, 3, 1, 3, 2, 3, 1, 3, 2, 2, 3, 1, 3, 2, 3, 1, 3, 1, 3, 2, 3, 1, 3, 1, 3, 2, 3, 1, 3, 2, 2, 3, 1, 3, 2, 3, 1, 3, 1, 3, 2, 3, 1, 3, 2, 2, 3, 1, 3, 2, 2, 3, 1, 3, 2, 3, 1, 3, 1, 3, 2, 3, 1, 3, 2, 2, 3, 1, 3, 2, 3, 1, 3, 1, 3, 2, 3, 1, 3, 1, 3, 2, 3, 1, 3, 2, 2, 3, 1, 3, 2, 3, 1, 3, 1, 3, 2, 3, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
J. M. Dumont and A. Thomas, Digital sum problems and substitutions on a finite alphabet, J. Number Theory, 39 (1991), 351-366.
|
|
MAPLE
|
subs({1=[1, 3], 2=[1, 3, 2, 2, 3], 3=[1, 3, 2, 3]}, 1): subs({1=[1, 3], 2=[1, 3, 2, 2, 3], 3=[1, 3, 2, 3]}, %):subs({1=[1, 3], 2=[1, 3, 2, 2, 3], 3=[1, 3, 2, 3]}, %):subs({1=[1, 3], 2=[1, 3, 2, 2, 3], 3=[1, 3, 2, 3]}, %):subs({1=[1, 3], 2=[1, 3, 2, 2, 3], 3=[1, 3, 2, 3]}, %); # all brackets have to be removed (Deutsch)
|
|
MATHEMATICA
|
Nest[ Flatten[ # /. {1 -> {1, 3}, 2 -> {1, 3, 2, 2, 3}, 3 -> {1, 3, 2, 3}}] &, {1}, 5] (from Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 20 2005)
|
|
CROSSREFS
|
Adjacent sequences: A106821 A106822 A106823 this_sequence A106825 A106826 A106827
Sequence in context: A126682 A016571 A055189 this_sequence A123508 A117621 A059660
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, May 20 2005
|
|
EXTENSIONS
|
More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), May 30 2005
|
|
|
Search completed in 0.002 seconds
|
