|
|
A224759
|
|
a(2)=8; thereafter a(n) = smallest number m such that a(n-1)+m = (a(n-1) followed by the leading digit of m).
|
|
0
|
|
|
8, 79, 718, 6468, 58217, 523958, 4715626, 42440638, 381965745, 3437691708, 30939225375, 278453028377, 2506077255395, 22554695298557, 202992257687015, 1826930319183136, 16442372872648225, 147981355853834026, 1331832202684506235, 11986489824160556116, 107878408417445005045, 970905675757005045414, 8738151081813045408734, 78643359736317408678613, 707790237626856678107524, 6370112138641710102967722
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The sequence is infinite: a(n) always exists.
For computer programs and examples see A224752.
|
|
REFERENCES
|
Eric Angelini, Postings to the Sequence Fans Mailing List, Apr 13 2013
|
|
LINKS
|
E. Angelini, Magic Sums [Cached copy, with permission]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|