[seqfan] Re: Sum avoidance on a decimal string

[Christopher Hohl]

Hi seqfans!  
Form a string K by concatenating the ordered set of Natural numbers from 1 to infinity.  Then a(n) is the least x > a(n-1) where x does not equal Sum{a_i..a_j} a_i, for i >= 1; with a_i some single digit in K, and with n >= j-i.
The first twelve entries (done on paper) are the following; 2,4,7,8,11,13,16,17,19,23,29,50,...
Fairly 'odious' to start, but quite quickly things run amok.
Looking for help computing much higher terms, if anyone has the interest- or the time.  
Although it is a fair impossibility, here's hoping everyone is well!                      ~ Christopher Hohl    
Sent from Yahoo Mail on Android