a(1) = 2. 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,2).
A091787
a(1) = 2. 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,2).
Terms
- a(0) =2a(1) =2a(2) =2a(3) =3a(4) =2a(5) =2a(6) =2a(7) =3a(8) =2a(9) =2a(10) =2a(11) =3a(12) =3a(13) =2a(14) =2a(15) =2a(16) =3a(17) =2a(18) =2a(19) =2a(20) =3a(21) =2a(22) =2a(23) =2a(24) =3a(25) =3a(26) =2a(27) =2a(28) =2a(29) =3
External references
- oeis: A091787