Search: id:A094006
Results 1-1 of 1 results found.

%I A094006
%S A094006 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,
%T A094006 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,
%U A094006 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
%N 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.
%H A094006 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 A094006 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 A094006 Cf. A090822.
%Y A094006 Sequence in context: A086197 A139336 A100619 this_sequence A140188 A140737 
               A108756
%Y A094006 Adjacent sequences: A094003 A094004 A094005 this_sequence A094007 A094008 
               A094009
%K A094006 nonn
%O A094006 1,4
%A A094006 N. J. A. Sloane (njas(AT)research.att.com), May 31 2004

Search completed in 0.001 seconds