|
| |
|
|
A093921
|
|
a(1) = 1; for n > 1, a(n) = curling number of (b(1),...,b(n-1)), where b() = Kolakoski sequence A000002.
|
|
2
| |
|
|
1, 1, 1, 2, 1, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,4
|
|
|
COMMENTS
| The curling number of a finite string S = (s(1),...,s(n)) is the largest integer k such that S can be written as xy^k for strings x and y (where y has positive length).
|
|
|
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, A000002, A093914.
Sequence in context: A035218 A139355 A039736 * A140192 A065373 A047895
Adjacent sequences: A093918 A093919 A093920 * A093922 A093923 A093924
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), May 26 2004
|
| |
|
|
