|
%I #5 Jan 02 2013 20:12:19
%S 2,3,1,3,1,2,3,1,2,2,3,1,3,1,2,2,3,1,2,3,1,3,1,2,3,1,2,2,3,1,2,3,1,3,
%T 1,2,2,3,1,3,1,2,3,1,2,2,3,1,3,1,2,2,3,1,2,3,1,3,1,2,2,3,1,3,1,2,3,1,
%U 2,2,3,1,2,3,1,3,1,2,3,1,2,2,3,1,3,1,2,2,3,1,2,3,1,3,1,2,3,1,2,2,3,1,2,3,1,3,1,2,2,3,1,3,1,2,3,1,2,2,3,1
%N Thue-Morse sequence (A010060) with 0 replaced by 2 and 1 replaced by 3,1.
%D Keisuke Nakano, Shall We Juggle, Coinductively?, in Certified Programs and Proofs, Lecture Notes in Computer Science Volume 7679, 2012, pp 160-172, DOI 10.1007/978-3-642-35308-6_14.
%Y Cf. A010060.
%K nonn
%O 0,1
%A _N. J. A. Sloane_, Jan 02 2013
|
