|
Search: id:A143668
|
|
|
| A143668 |
|
Result of the morphing 01->01021212, 02->0102121201, 12->01021201, iterated from '01'. Sequence of the Fibonacci fractal. |
|
+0
1
|
|
| 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 2, 1, 2, 1, 2, 0, 1, 0, 1, 0, 2, 1, 2
(list; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
Letter '2' is always in an even position and '0' an odd position.
When replacing '2' by '0', equals the infinite Fibonacci number (see A003849)
This sequence produces the Fibonacci fractal when applying the following turtle graphics rules : 0->draw segment+turn right, 1-> draw segment, 2-> draw segment+turn left (A. Monnerot-Dumaine 2008 see links).
|
|
REFERENCES
|
M. Lothaire, Combinatorics on words, Cambridge University press.
|
|
LINKS
|
Alexis Monnerot-Dumaine, Fibonacci Fractal
|
|
FORMULA
|
let b(n) the infinite Fibonacci word. if (b(n)=0 and n is even), then a(n)=2, else a(n)=b(n).
|
|
CROSSREFS
|
Cf. A003849
Sequence in context: A140324 A010250 A060024 this_sequence A029445 A107393 A047885
Adjacent sequences: A143665 A143666 A143667 this_sequence A143669 A143670 A143671
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexis Monnerot-Dumaine (alexis.monnerotdumaine(AT)gmail.com), Aug 28 2008
|
|
|
Search completed in 0.002 seconds
|
