|
|
A224754
|
|
a(2)=3; thereafter a(n) = smallest number m such that a(n-1)+m = (a(n-1) followed by the leading digit of m).
|
|
0
|
|
|
3, 29, 263, 2369, 21323, 191908, 1727173, 15544558, 139901023, 1259109208, 11331982873, 101987845858, 917890612731, 8261015514587, 74349139631290, 669142256681616, 6022280310134550, 54200522791210955, 487804705120898599, 4390242346088087395
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
E. Angelini, Magic Sums [Cached copy, with permission]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|