|
Search: id:A014707
|
|
|
| A014707 |
|
a(4n)=0, a(4n+2)=1, a(2n+1)=a(n). |
|
+0
9
|
|
| 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, 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, 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
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
The regular paper-folding (or dragon curve) sequence.
|
|
REFERENCES
|
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.
G. Melancon, Factorizing infinite words using Maple, MapleTech journal, vol. 4, no. 1, 1997, pp. 34-42, esp. p. 36.
|
|
LINKS
|
J.-P. Allouche, M. Mendes France, A. Lubiw, A.J. van der Poorten and J. Shallit, Convergents of folded continued fractions
J.-Y. Kao et al., Words avoiding repetitions in arithmetic progressions
G. Melancon, Home page
Index entries for sequences obtained by enumerating foldings
|
|
FORMULA
|
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).
|
|
CROSSREFS
|
Equals 1 - A014577, which see for further references. Also a(n) = A038189(n+1).
Sequence in context: A028999 A091244 A131378 this_sequence A106138 A059125 A111406
Adjacent sequences: A014704 A014705 A014706 this_sequence A014708 A014709 A014710
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Scott C. Lindhurst (ScottL(AT)alumni.princeton.edu)
|
|
|
Search completed in 0.002 seconds
|
