login
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

%I #14 Jun 10 2016 00:21:00

%S 10,99,899,8099,72898,656088,5904797,53143178,478288606,4304597458,

%T 38741377125,348672394128,3138051547155,28242463924397,

%U 254182175319575,2287639577876177,20588756200885595,185298805807970356,1667689252271733205,15009203270445598846,135082829434010389615,1215745464906093506536,10941709184154841558825,98475382657393574029434,886278443916542166264914,7976505995248879496384233

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

%C The sequence is infinite: a(n) always exists.

%C For computer programs and examples see A224752.

%D Eric Angelini, Postings to the Sequence Fans Mailing List, Apr 13 2013

%H Eric Angelini, <a href="http://www.cetteadressecomportecinquantesignes.com/MagicalSum.htm">Magic Sums</a>

%H E. Angelini, <a href="/A224752/a224752.pdf">Magic Sums</a> [Cached copy, with permission]

%F a(n) = A224752(n+1). - _R. J. Mathar_, Apr 22 2013

%Y Cf. A224752-A224761.

%K nonn,base

%O 1,1

%A _N. J. A. Sloane_, Apr 21 2013