|
|
A016096
|
|
a(n+1) = a(n) + sum of its digits, with a(1) = 9.
|
|
13
|
|
|
9, 18, 27, 36, 45, 54, 63, 72, 81, 90, 99, 117, 126, 135, 144, 153, 162, 171, 180, 189, 207, 216, 225, 234, 243, 252, 261, 270, 279, 297, 315, 324, 333, 342, 351, 360, 369, 387, 405, 414, 423, 432, 441, 450, 459, 477, 495, 513, 522, 531, 540
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
REFERENCES
|
D. R. Kaprekar, Puzzles of the Self-Numbers. 311 Devlali Camp, Devlali, India, 1959.
D. R. Kaprekar, The Mathematics of the New Self Numbers, Privately printed, 311 Devlali Camp, Devlali, India, 1963.
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(Haskell)
a016096 n = a016096_list !! (n-1)
(Python)
from itertools import islice
def A016096_gen(): # generator of terms
a = 9
while True:
yield a
a += sum(int(d) for d in str(a))
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|