|
| |
|
|
A094006
|
|
a(1) = a(2) = 1; for n>1, a(n+1) = largest integer k such that the word a(1)a(2)...a(n-1) is of the form xy^k for words x and y (where y has positive length), i.e. the maximal number of repeating blocks at the end of the sequence so far.
|
|
0
| |
|
|
1, 1, 1, 2, 3, 1, 1, 1, 2, 3, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 2, 2, 3, 4, 1, 1, 1, 2, 3, 1, 1, 1, 2, 3, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 2, 2, 3, 4, 1, 2, 2, 1, 2, 1, 1, 2, 2, 1, 2, 1, 1, 2, 2, 2, 2, 3, 4, 1, 2, 2, 2, 2, 3, 4, 1, 2, 2, 2, 2, 3, 4, 2, 3, 1, 1, 1, 2, 3, 1, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
LINKS
| F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and A. R. Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence, J. Integer Sequences, Vol. 10 (2007), #07.1.2.
F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and A. R. Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence [pdf, ps].
|
|
|
CROSSREFS
| Cf. A090822.
Sequence in context: A086197 A139336 A100619 * A179617 A140188 A180050
Adjacent sequences: A094003 A094004 A094005 * A094007 A094008 A094009
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 31 2004
|
| |
|
|
