A224761 a(2)=10; thereafter a(n) = smallest number m such that a(n-1)+m = (a(n-1) followed by the leading digit of m).

10, 99, 899, 8099, 72898, 656088, 5904797, 53143178, 478288606, 4304597458, 38741377125, 348672394128, 3138051547155, 28242463924397, 254182175319575, 2287639577876177, 20588756200885595, 185298805807970356, 1667689252271733205, 15009203270445598846, 135082829434010389615, 1215745464906093506536, 10941709184154841558825, 98475382657393574029434, 886278443916542166264914, 7976505995248879496384233

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]

Formula

a(n) = A224752(n+1). - R. J. Mathar, Apr 22 2013

Crossrefs

Cf. A224752-A224761.

Sequence in context: A129542 A359482 A224752 * A171315 A370043 A081109

Adjacent sequences: A224758 A224759 A224760 * A224762 A224763 A224764

Keyword

nonn,base

Author

N. J. A. Sloane, Apr 21 2013

Status

approved