For S a string of numbers, let F(S) = the sum of those numbers. Let a(1)=1. For n>1, a(n) is the largest k such that the string 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 positive (but not necessarily all the same) length and F(y_i)=F(y_j) for all i,j<=k.

A092331

For S a string of numbers, let F(S) = the sum of those numbers. Let a(1)=1. For n>1, a(n) is the largest k such that the string 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 positive (but not necessarily all the same) length and F(y_i)=F(y_j) for all i,j<=k.

Terms

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

External references