Let a(1)=1. For n>1, a(n) is the greatest k such that a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive and equal length and for any i,j, y_i and y_j agree at every other term starting from the left (see example).

A092335

Let a(1)=1. For n>1, a(n) is the greatest k such that a(1)a(2)...a(n-1) can be written in the form [x][y_1][y_2]...[y_k] where each y_i is of positive and equal length and for any i,j, y_i and y_j agree at every other term starting from the left (see example).

Terms

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

External references