%I A014710
%S A014710 2,2,1,2,2,1,1,2,2,2,1,1,2,1,1,2,2,2,1,2,2,1,1,1,2,2,1,1,2,1,1
%N A014710 The regular paper-folding (or dragon curve) sequence.
%D A014710 G. Melancon, Factorizing infinite words using Maple, MapleTech journal, 
               vol. 4, no. 1, 1997, pp. 34-42, esp. p. 36.
%H A014710 <a href="Sindx_Fo.html#fold">Index entries for sequences obtained by 
               enumerating foldings</a>
%F A014710 Set a=2, b=1, S(0)=a, S(n+1) = S(n)aF(S(n)), where F(x) reverses x and 
               then interchanges a and b; sequence is limit S(infinity).
%F A014710 a(4n) = 2, a(4n+2) = 1, a(2n+1) = a(n).
%Y A014710 See A014577 for more references and more terms.
%Y A014710 Sequence in context: A165018 A131837 A087889 this_sequence A055174 A096369 
               A102297
%Y A014710 Adjacent sequences: A014707 A014708 A014709 this_sequence A014711 A014712 
               A014713
%K A014710 nonn
%O A014710 0,1
%A A014710 N. J. A. Sloane (njas(AT)research.att.com).