%I A014709
%S A014709 1,1,2,1,1,2,2,1,1,1,2,2,1,2,2,1,1,1,2,1,1,2,2,2,1,1,2,2,1,2,2
%N A014709 The regular paper-folding (or dragon curve) sequence.
%D A014709 G. Melancon, Factorizing infinite words using Maple, MapleTech journal, 
               vol. 4, no. 1, 1997, pp. 34-42, esp. p. 36.
%H A014709 <a href="Sindx_Fo.html#fold">Index entries for sequences obtained by 
               enumerating foldings</a>
%F A014709 Set a=1, b=2, 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 A014709 a(4n) = 1, a(4n+2) = 2, a(2n+1) = a(n).
%Y A014709 See A014577 for more references and more terms.
%Y A014709 Sequence in context: A091243 A037826 A079882 this_sequence A069258 A126207 
               A046219
%Y A014709 Adjacent sequences: A014706 A014707 A014708 this_sequence A014710 A014711 
               A014712
%K A014709 nonn
%O A014709 0,3
%A A014709 N. J. A. Sloane (njas(AT)research.att.com).