a(1) = 0; for n>1, find 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., k = the maximal number of repeating blocks at the end of the sequence so far; then a(n) = floor(k/2).

A091970

a(1) = 0; for n>1, find 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., k = the maximal number of repeating blocks at the end of the sequence so far; then a(n) = floor(k/2).

Terms

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

External references