%I #10 Aug 02 2014 06:17:47
%S 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,
%T 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,
%U 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
%N a(1) = 1; for n > 1, a(n) = curling number of (b(1),...,b(n-1)), where b() = Kolakoski sequence A000002.
%C 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).
%H F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, <a href="http://www.cs.uwaterloo.ca/journals/JIS/index.html">A Slow-Growing Sequence Defined by an Unusual Recurrence</a>, J. Integer Sequences, Vol. 10 (2007), #07.1.2.
%H F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and Allan Wilks, A Slow-Growing Sequence Defined by an Unusual Recurrence [<a href="http://neilsloane.com/doc/gijs.pdf">pdf</a>, <a href="http://neilsloane.com/doc/gijs.ps">ps</a>].
%H <a href="/index/Cu#curling_numbers">Index entries for sequences related to curling numbers</a>
%Y Cf. A090822, A000002, A093914.
%K nonn
%O 1,4
%A _N. J. A. Sloane_, May 26 2004