|
| |
|
|
A105699
|
|
Four-symbol substitution that gives carpet-like fractal: Characteristic polynomial: x^4-4*x^3-4*x^2+16*x.
|
|
0
| |
|
|
1, 4, 2, 1, 4, 1, 3, 4, 2, 1, 3, 2, 1, 4, 2, 1, 4, 1, 3, 4, 1, 4, 2, 1, 3, 2, 4, 3, 4, 1, 3, 4, 2, 1, 3, 2, 3, 2, 4, 3, 1, 4, 2, 1, 2, 1, 3, 2, 1, 4, 2, 1, 4, 1, 3, 4, 2, 1, 3, 2, 1, 4, 2, 1, 4, 1, 3, 4, 1, 4, 2, 1, 3, 2, 4, 3, 4, 1, 3, 4, 1, 4, 2, 1, 4, 1, 3, 4, 2, 1, 3, 2, 1, 4, 2, 1, 3, 2, 4, 3, 4, 1, 3, 4, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,2
|
|
|
COMMENTS
| One symbol per substitution added symmetrically to Dekking's Peano set with order reversed permutaion of substitutions.
|
|
|
REFERENCES
| F. M. Dekking, "Recurrent Sets", Advances in Mathematics, vol. 44, no.1, April 1982, page 85, section 4.1
|
|
|
FORMULA
| 4->{1, 4, 2, 1}, 3->{2, 1, 3, 2}, 2->{3, 2, 4, 3}, 1->{4, 1, 3, 4}
|
|
|
MATHEMATICA
| s[4] = {1, 4, 2, 1}; s[3] = {2, 1, 3, 2}; s[2] = {3, 2, 4, 3}; s[1] = {4, 1, 3, 4}; 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: A010311 A023528 A105698 * A023526 A082901 A136619
Adjacent sequences: A105696 A105697 A105698 * A105700 A105701 A105702
|
|
|
KEYWORD
| nonn,uned
|
|
|
AUTHOR
| Roger L. Bagula (rlbagulatftn(AT)yahoo.com), May 04 2005
|
| |
|
|
