This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A014710 The regular paper-folding (or dragon curve) sequence. 10
 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, 2, 2, 2, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 2, 2, 2, 1, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 1, 2, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 REFERENCES G. Melancon, Factorizing infinite words using Maple, MapleTech journal, vol. 4, no. 1, 1997, pp. 34-42, esp. p. 36. LINKS Ivan Panchenko, Table of n, a(n) for n = 0..10000 FORMULA 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). a(4n) = 2, a(4n+2) = 1, a(2n+1) = a(n). PROG (PARI) a(n)=if(n%2==0, 2-bitand(1, n\2), a(n\2) ); for(n=0, 122, print1(a(n), ", ")) CROSSREFS See A014577 for more references and more terms. The following are all essentially the same sequence: A014577, A014707, A014709, A014710, A034947, A038189, A082410. - N. J. A. Sloane, Jul 27 2012 Sequence in context: A323018 A192064 A225182 * A055174 A096369 A102297 Adjacent sequences:  A014707 A014708 A014709 * A014711 A014712 A014713 KEYWORD nonn AUTHOR STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified October 19 13:01 EDT 2019. Contains 328222 sequences. (Running on oeis4.)