|
|
A143668
|
|
Result of the morphing 01->01021212, 02->0102121201, 12->01021201, iterated from '01'. Sequence of the Fibonacci word fractal.
|
|
0
|
|
|
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;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
Letter '2' is always in an even position and '0' an odd position.
When replacing '2' by '0', equals the infinite Fibonacci word (see A003849).
This sequence produces the Fibonacci word 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
|
|
|
FORMULA
|
Let (b(n)) be the infinite Fibonacci word. if (b(n)=0 and n is even), then a(n)=2, else a(n)=b(n).
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Alexis Monnerot-Dumaine (alexis.monnerotdumaine(AT)gmail.com), Aug 28 2008
|
|
STATUS
|
approved
|
|
|
|