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 of positive (but not necessarily equal) length and for any i<k, F(y_i)>=F(y_(i+1)).
A092333
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 of positive (but not necessarily equal) length and for any i<k, F(y_i)>=F(y_(i+1)).
Terms
- a(0) =1a(1) =1a(2) =2a(3) =2a(4) =3a(5) =2a(6) =3a(7) =3a(8) =4a(9) =3a(10) =4a(11) =4a(12) =5a(13) =4a(14) =5a(15) =4a(16) =5a(17) =5a(18) =6a(19) =5a(20) =6a(21) =6a(22) =7a(23) =5a(24) =6a(25) =6a(26) =7a(27) =7a(28) =8a(29) =7
External references
- oeis: A092333