%I #14 Jun 15 2015 04:08:02

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

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

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

%N Duplicate of A105698.

%C One symbol per substitution added symmetrically to Dekking's Peano set with order reversed permutation of substitutions.

%H F. M. Dekking, <a href="http://dx.doi.org/10.1016/0001-8708(82)90066-4">Recurrent Sets</a>, Advances in Mathematics, vol. 44, no.1, April 1982, page 85, section 4.1

%F 4->{1, 4, 2, 1}, 3->{2, 1, 3, 2}, 2->{3, 2, 4, 3}, 1->{4, 1, 3, 4}

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

%K dead

%O 0,2

%A _Roger L. Bagula_, May 04 2005