|
Search: id:A014709
|
|
|
| A014709 |
|
The regular paper-folding (or dragon curve) sequence. |
|
+0
2
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
G. Melancon, Factorizing infinite words using Maple, MapleTech journal, vol. 4, no. 1, 1997, pp. 34-42, esp. p. 36.
|
|
LINKS
|
Index entries for sequences obtained by enumerating foldings
|
|
FORMULA
|
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).
a(4n) = 1, a(4n+2) = 2, a(2n+1) = a(n).
|
|
CROSSREFS
|
See A014577 for more references and more terms.
Sequence in context: A091243 A037826 A079882 this_sequence A069258 A126207 A046219
Adjacent sequences: A014706 A014707 A014708 this_sequence A014710 A014711 A014712
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
