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).

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

Table of n, a(n) for n=1..26.

Eric Angelini, Magic Sums

E. Angelini, Magic Sums [Cached copy, with permission]

Crossrefs

Cf. A224752-A224761.

Sequence in context: A218421 A293841 A351586 * A198969 A155629 A096596

Adjacent sequences: A224753 A224754 A224755 * A224757 A224758 A224759

Keyword

nonn,base

Author

N. J. A. Sloane, Apr 21 2013

Status

approved