|
%I #12 Jun 10 2016 00:21:00
%S 5,49,445,4009,36084,324759,2922833,26305499,236749493,2130745439,
%T 19176708952,172590380569,1553313425122,13979820826099,
%U 125818387434892,1132365486914029,10191289382226262,91721604440036367,825494439960327311,7429449959642945806,66865049636786512260,601785446731078610346,5416069020579707493119,48744621185217367438075,438701590666956306942679,3948314316002606762484114
%N 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).
%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]
%Y Cf. A224752-A224761.
%K nonn,base
%O 1,1
%A _N. J. A. Sloane_, Apr 21 2013
|
