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