|
Search: id:A106638
|
|
|
| A106638 |
|
3-symbol substitution that gives a dragon fractal. |
|
+0 1
|
|
| 1, 2, 2, 1, 2, 3, 3, 2, 2, 3, 3, 2, 1, 2, 2, 1, 2, 3, 3, 2, 3, 1, 1, 3, 3, 1, 1, 3, 2, 3, 3, 2, 2, 3, 3, 2, 3, 1, 1, 3, 3, 1, 1, 3, 2, 3, 3, 2, 1, 2, 2, 1, 2, 3, 3, 2, 2, 3, 3, 2, 1, 2, 2, 1, 2, 3, 3, 2, 3, 1, 1, 3, 3, 1, 1, 3, 2, 3, 3, 2, 3, 1, 1, 3, 1, 2, 2, 1, 1, 2, 2, 1, 3, 1, 1, 3, 3, 1, 1, 3, 1, 2, 2, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
FORMULA
|
1->{2, 1, 1, 2}, 2->{2, 3, 3, 2}, 3->{3, 1, 1, 3}
|
|
MATHEMATICA
|
s[1] = {1, 2, 2, 1}; s[2] = {2, 3, 3, 2}; s[3] = {3, 1, 1, 3}; t[a_] := Flatten[s /@ a] p[0] = {1}; p[1] = t[p[0]]; p[n_] := t[p[n - 1]] aa = p[4]
|
|
CROSSREFS
|
Sequence in context: A106580 A043276 A064742 this_sequence A131909 A131730 A029335
Adjacent sequences: A106635 A106636 A106637 this_sequence A106639 A106640 A106641
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 11 2005
|
|
|
Search completed in 0.002 seconds
|