|
| |
|
|
A074983
|
|
Successive factors of the Fibonacci word A003842.
|
|
0
| |
|
|
12, 11212, 1121121211212, 1121121211211212112121121121211212, 11211212112112121121211211212112112121121211211212112121121121211211212112121121121211212
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Next term is 233 digits long. [Sean A. Irvine, Oct 31 2011]
|
|
|
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.
|
|
|
FORMULA
| Let b(1)=112, b(2)=12, a(1)=12. If a(n)=c(1)c(2)...c(m), then a(n+1)=b(c(1))b(c(2))...b(c(m)), where c(i) is is the ith digit of a(n). [Sean A. Irvine, Oct 31 2011]
|
|
|
CROSSREFS
| Sequence in context: A012732 A001322 A159411 * A159413 A012608 A012735
Adjacent sequences: A074980 A074981 A074982 * A074984 A074985 A074986
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Mar 28 2003
|
|
|
EXTENSIONS
| More terms from Sean A. Irvine (sairvin(AT)xtra.co.nz), Oct 30 2011
|
| |
|
|
