|
%I #11 Jun 10 2016 00:21:00
%S 8,79,718,6468,58217,523958,4715626,42440638,381965745,3437691708,
%T 30939225375,278453028377,2506077255395,22554695298557,
%U 202992257687015,1826930319183136,16442372872648225,147981355853834026,1331832202684506235,11986489824160556116,107878408417445005045,970905675757005045414,8738151081813045408734,78643359736317408678613,707790237626856678107524,6370112138641710102967722
%N a(2)=8; 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
|
