|
Search: id:A106693
|
|
|
| A106693 |
|
3 symbols taken seven at a time symmetrically. |
|
+0
1
|
|
| 1, 1, 3, 2, 3, 1, 1, 1, 1, 3, 2, 3, 1, 1, 3, 3, 2, 1, 2, 3, 3, 2, 2, 1, 3, 1, 2, 2, 3, 3, 2, 1, 2, 3, 3, 1, 1, 3, 2, 3, 1, 1, 1, 1, 3, 2, 3, 1, 1, 1, 1, 3, 2, 3, 1, 1, 1, 1, 3, 2, 3, 1, 1, 3, 3, 2, 1, 2, 3, 3, 2, 2, 1, 3, 1, 2, 2, 3, 3, 2, 1, 2, 3, 3, 1, 1, 3, 2, 3, 1, 1, 1, 1, 3, 2, 3, 1, 1, 3, 3, 2, 1, 2, 3, 3
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
This substitution gives a dragon like tile: aa=p[6]; bb = aa /. 1 -> {-1, N[Sqrt[3]]}/2 /. 2 -> {-1, -N[Sqrt[3]]}/2 /. 3 -> {1, 0}; ListPlot[FoldList[Plus, {0, 0}, bb], PlotJoined -> False, PlotRange -> All, Axes -> False];
|
|
FORMULA
|
1->{1, 1, 3, 2, 3, 1, 1}, 2->{2, 2, 1, 3, 1, 2, 2}, 3->{3, 3, 2, 1, 2, 3, 3}
|
|
MATHEMATICA
|
s[1] = {1, 1, 3, 2, 3, 1, 1}; s[2] = {2, 2, 1, 3, 1, 2, 2}; s[3] = {3, 3, 2, 1, 2, 3, 3}; t[a_] := Flatten[s /@ a]; p[0] = {1}; p[1] = t[p[0]]; p[n_] := t[p[n - 1]] aa = p[3]
|
|
CROSSREFS
|
Sequence in context: A166592 A103497 A085747 this_sequence A107335 A082391 A046818
Adjacent sequences: A106690 A106691 A106692 this_sequence A106694 A106695 A106696
|
|
KEYWORD
|
nonn,uned
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 13 2005
|
|
|
Search completed in 0.002 seconds
|
