%I A091799
%S A091799 3,3,3,3,4,3,3,3,3,4,3,3,3,3,4,3,3,3,3,4,4,3,3,3,3,4,3,3,3,3,4,3,3,
%T A091799 3,3,4,3,3,3,3,4,4,3,3,3,3,4,3,3,3,3,4,3,3,3,3,4,3,3,3,3,4,4,3,3,3,
%U A091799 3,4,3,3,3,3,4,3,3,3,3,4,3,3,3,3,4,4,4,3,3,3,3,4,3,3,3,3,4,3,3,3,3
%N A091799 a(1) = 3. To get a(n+1), write the string a(1)a(2)...a(n) as xy^k for 
               words x and y (where y has positive length) and k is maximized, i.e. 
               k = the maximal number of repeating blocks at the end of the sequence 
               so far. Then a(n+1) = max(k,3).
%C A091799 Here xy^k means the concatenation of the words x and k copies of y.
%H A091799 F. J. van de Bult, D. C. Gijswijt, J. P. Linderman, N. J. A. Sloane and 
               A. R. 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 A091799 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 
               [<a href="http://www.research.att.com/~njas/doc/gijs.pdf">pdf</a>
               , <a href="http://www.research.att.com/~njas/doc/gijs.ps">ps</a>].
%Y A091799 Cf. A090822, A091787, A091844.
%Y A091799 Sequence in context: A105121 A092282 A048181 this_sequence A035936 A006671 
               A046074
%Y A091799 Adjacent sequences: A091796 A091797 A091798 this_sequence A091800 A091801 
               A091802
%K A091799 nonn
%O A091799 1,1
%A A091799 N. J. A. Sloane (njas(AT)research.att.com), Mar 08 2004