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).

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).

Terms

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

External references