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

6, 59, 536, 4828, 43456, 391107, 3519966, 31679697, 285117275, 2566055477, 23094499295, 207850493657, 1870654442914, 16835889986227, 151523009876044, 1363707088884397, 12273363799959574, 110460274199636167, 994142467796725512, 8947282210170529616, 80525539891534766552, 724729859023812898975, 6522568731214316090781, 58703118580928844817034, 528328067228359603353311, 4754952605055236430179803, 42794573445497127871618231

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

Eric Angelini, Magic Sums

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

Crossrefs

Cf. A224752-A224761.

Sequence in context: A034982 A156147 A024269 * A354864 A114501 A369513

Adjacent sequences: A224754 A224755 A224756 * A224758 A224759 A224760

Keyword

nonn,base

Author

N. J. A. Sloane, Apr 21 2013

Status

approved