%I A014707
%S A014707 0,0,1,0,0,1,1,0,0,0,1,1,0,1,1,0,0,0,1,0,0,1,1,1,0,0,1,1,0,1,1,
%T A014707 0,0,0,1,0,0,1,1,0,0,0,1,1,0,1,1,1,0,0,1,0,0,1,1,1,0,0,1,1,0,1,
%U A014707 1,0,0,0,1,0,0,1,1,0,0,0,1,1,0,1,1,0,0,0,1,0,0,1,1,1,0,0,1,1,0
%N A014707 a(4n)=0, a(4n+2)=1, a(2n+1)=a(n).
%C A014707 The regular paper-folding (or dragon curve) sequence.
%D A014707 G. Melancon, Lyndon factorization of infinite words, STACS 96 (Grenoble, 
               1996), 147-154, Lecture Notes in Comput. Sci., 1046, Springer, Berlin, 
               1996. Math. Rev. 98h:68188.
%D A014707 G. Melancon, Factorizing infinite words using Maple, MapleTech journal, 
               vol. 4, no. 1, 1997, pp. 34-42, esp. p. 36.
%H A014707 J.-P. Allouche, M. Mendes France, A. Lubiw, A.J. van der Poorten and 
               J. Shallit, <a href="http://www.lri.fr/~allouche/bibliorecente.html">
               Convergents of folded continued fractions</a>
%H A014707 J.-Y. Kao et al., <a href="http://arXiv.org/abs/math.CO/0608607">Words 
               avoiding repetitions in arithmetic progressions</a>
%H A014707 G. Melancon, <a href="http://www.lirmm.fr/~melancon/">Home page</a>
%H A014707 <a href="Sindx_Fo.html#fold">Index entries for sequences obtained by 
               enumerating foldings</a>
%F A014707 Set a=0, 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).
%Y A014707 Equals 1 - A014577, which see for further references. Also a(n) = A038189(n+1).
%Y A014707 Sequence in context: A028999 A091244 A131378 this_sequence A106138 A059125 
               A111406
%Y A014707 Adjacent sequences: A014704 A014705 A014706 this_sequence A014708 A014709 
               A014710
%K A014707 nonn,easy,nice
%O A014707 0,1
%A A014707 N. J. A. Sloane (njas(AT)research.att.com).
%E A014707 More terms from Scott C. Lindhurst (ScottL(AT)alumni.princeton.edu)