For S a string of numbers, let F(S) = the product of those numbers. 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 (but not necessarily all the same) length and F(y_i)=F(y_j) for all i,j<=k.

A092332

For S a string of numbers, let F(S) = the product of those numbers. 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 (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) =1a(4) =1a(5) =2a(6) =2a(7) =3a(8) =1a(9) =1a(10) =2a(11) =1a(12) =1a(13) =2a(14) =2a(15) =3a(16) =2a(17) =2a(18) =2a(19) =3a(20) =3a(21) =2a(22) =2a(23) =4a(24) =2a(25) =2a(26) =3a(27) =2a(28) =1a(29) =1

External references