

A094916


a(1) = 1; for n > 1, a(n) = curling number of (b(1),...,b(n1)), where b() = Fibonacci word A003849 (with offset changed to 1).


1



1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 2, 2, 2, 3, 3, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 2, 2, 3, 2, 3, 3, 3, 3, 2, 2, 2, 3, 3, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 3, 3, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,5


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

Table of n, a(n) for n=1..105.
F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A SlowGrowing 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 Allan Wilks, A SlowGrowing Sequence Defined by an Unusual Recurrence [pdf, ps].
Index entries for sequences related to Gijswijt's sequence


EXAMPLE

b(1) to b(12) are 0,1,0,0,1,0,1,0,0,1,0,0, which we can write as xy^2 with x = 0,1,0,0,1,0 and y = 1,0,0; and no greater k is possible, so a(12) = 2.


CROSSREFS

Cf. A090822, A003849, A093914, A093921.
Sequence in context: A088601 A261675 A028950 * A036485 A331971 A030547
Adjacent sequences: A094913 A094914 A094915 * A094917 A094918 A094919


KEYWORD

nonn,easy


AUTHOR

N. J. A. Sloane, Jun 18 2004


EXTENSIONS

More terms from David Wasserman, Jul 03 2007


STATUS

approved



