RE : a(n) is the sum of the first a(n) digits

[Eric Angelini]

Same constraint, same building rule, but dropping the monotonicality is a nightmare to calculate by hand; help, please! ;-)
I get this:
 
1,10,2,4,100,101,11,12,13,14,30,1000,10000,40,41,100000,102,43,60,200,1000000,1001,61,80,1002,10000000000,90,10000000,103,104,10001,111,105,10003,91,...
 
Best,
E.

________________________________

De: Eric Angelini
Date: sam. 22/03/2008 11:02
À: seqfan at ext.jussieu.fr
Objet : a(n) is the sum of the first a(n) digits



Hello SeqFans,

I like this seq :

S=1,10,11,12,20,111,112,120,1000,1001,1002,1003,1004,1005,1006,1007,1008,1009,1010,1011,1012,1013,1014,1015,1016,10000,10000000000,10000000800,10000000801,10000000802,10000000803,...

... where a(n) is the sum of the first a(n) digits. (Example: "12" says that the first 12 digits sum up to 12, which is true: 1+1+0+1+1+1+2+2+0+1+1+1=12)

Seq is monotonically increasing and every new term must be as small as possible.

Could someone check this (and compute a few more terms)?

Best,

É.

 

 

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20080322/ec5f9ea2/attachment-0001.htm>