login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A106642 A four-symbol four-at-a-time substitution with an ordering change: q=1. 0

%I #9 Nov 25 2018 23:44:08

%S 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,

%T 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,

%U 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

%N A four-symbol four-at-a-time substitution with an ordering change: q=1.

%C 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.

%F 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}.

%t 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]

%K nonn,uned

%O 0,2

%A _Roger L. Bagula_, May 12 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 1 14:05 EDT 2024. Contains 372174 sequences. (Running on oeis4.)