login
A224756
a(2)=5; thereafter a(n) = smallest number m such that a(n-1)+m = (a(n-1) followed by the leading digit of m).
0
5, 49, 445, 4009, 36084, 324759, 2922833, 26305499, 236749493, 2130745439, 19176708952, 172590380569, 1553313425122, 13979820826099, 125818387434892, 1132365486914029, 10191289382226262, 91721604440036367, 825494439960327311, 7429449959642945806, 66865049636786512260, 601785446731078610346, 5416069020579707493119, 48744621185217367438075, 438701590666956306942679, 3948314316002606762484114
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
Eric Angelini, Magic Sums
E. Angelini, Magic Sums [Cached copy, with permission]
CROSSREFS
KEYWORD
nonn,base
AUTHOR
N. J. A. Sloane, Apr 21 2013
STATUS
approved