login
Table read by rows where T(0,0)=0; n-th row has 2^n terms T(n,j),j=0 to 2^n-1. T(n,T088208(n,j))=2^n-j, where T088208 is the table described in A088208.
2

%I #6 Mar 30 2012 17:29:10

%S 0,2,1,4,1,3,2,8,1,5,4,7,2,6,3,16,1,9,8,13,4,12,5,15,2,10,7,14,3,11,6,

%T 32,1,17,16,25,8,24,9,29,4,20,13,28,5,21,12,31,2,18,15,26,7,23,10,30,

%U 3,19,14,27,6,22,11,64,1,33,32,49,16,48,17,57,8,40,25,56,9,41,24,61,4,36

%N Table read by rows where T(0,0)=0; n-th row has 2^n terms T(n,j),j=0 to 2^n-1. T(n,T088208(n,j))=2^n-j, where T088208 is the table described in A088208.

%C A Thue-Morse generator using the "Ordering of Iterates" algorithm.

%D Manfred R. Schroeder, "Fractals, Chaos, Power Laws", W.H. Freeman, 1991, p. 282, 265.

%e 0

%e 2 1

%e 4 1 3 2

%e 8 1 5 4 7 2 6 3

%e ...

%Y Cf. A088208, A010060.

%K nonn,tabl

%O 0,2

%A _Gary W. Adamson_, Sep 28 2003

%E Edited by _Ray Chandler_ and _N. J. A. Sloane_, Oct 08 2003