login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A106642
A four-symbol four-at-a-time substitution with an ordering change: q=1.
0
1, 4, 4, 1, 4, 3, 3, 4, 4, 3, 3, 4, 1, 4, 4, 1, 4, 3, 3, 4, 3, 2, 2, 3, 3, 2, 2, 3, 4, 3, 3, 4, 4, 3, 3, 4, 3, 2, 2, 3, 3, 2, 2, 3, 4, 3, 3, 4, 1, 4, 4, 1, 4, 3, 3, 4, 4, 3, 3, 4, 1, 4, 4, 1, 4, 3, 3, 4, 3, 2, 2, 3, 3, 2, 2, 3, 4, 3, 3, 4, 3, 2, 2, 3, 2, 1, 1, 2, 2, 1, 1, 2, 3, 2, 2, 3, 3, 2, 2, 3, 2, 1, 1, 2, 2
OFFSET
0,2
COMMENTS
This substitution gives two border-like 90-degree fractals, one (q=1) of which appears to tile. This substitution is a symmetrical doubling of the Levy's dragon-Heighway's dragon ordering.
FORMULA
1->{2, 1, 1, 2}, 2->q*{3, 2, 2, 3} + (1 - q)*{2, 3, 3, 2}, 3->{4, 3, 3, 4}, 4->q*{1, 4, 4, 1} + (1 - q)*{4, 1, 1, 4}.
MATHEMATICA
q = 1; s[1] = {2, 1, 1, 2}; s[2] = q*{3, 2, 2, 3} + (1 -q)*{2, 3, 3, 2}; s[3] = {4, 3, 3, 4}; s[4] = q*{1, 4, 4, 1} + (1 - q)*{4, 1, 1, 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: A055180 A030788 A087709 * A327855 A213056 A135012
KEYWORD
nonn,uned
AUTHOR
Roger L. Bagula, May 12 2005
STATUS
approved