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.

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.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =2a(4) =3a(5) =1a(6) =1a(7) =1a(8) =2a(9) =3a(10) =1a(11) =2a(12) =2a(13) =1a(14) =2a(15) =1a(16) =1a(17) =2a(18) =2a(19) =1a(20) =2a(21) =1a(22) =1a(23) =2a(24) =2a(25) =2a(26) =2a(27) =3a(28) =4a(29) =1

External references