|
Search: id:A057147
|
|
|
| A057147 |
|
n times sum of digits of n. |
|
+0
2
|
|
| 0, 1, 4, 9, 16, 25, 36, 49, 64, 81, 10, 22, 36, 52, 70, 90, 112, 136, 162, 190, 40, 63, 88, 115, 144, 175, 208, 243, 280, 319, 90, 124, 160, 198, 238, 280, 324, 370, 418, 468, 160, 205, 252, 301, 352, 405, 460, 517, 576, 637, 250, 306, 364, 424, 486, 550, 616
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
MAPLE
|
for n from 0 to 150 do printf(`%d, `, n*add(convert(n, base, 10)[i], i=1..nops(convert(n, base, 10)))) od:
|
|
CROSSREFS
|
Cf. A007953, A003634, A005349, A052489, A052490, A003635.
Sequence in context: A083163 A068522 A048385 this_sequence A061205 A048387 A035121
Adjacent sequences: A057144 A057145 A057146 this_sequence A057148 A057149 A057150
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
njas, Sep 13 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu) and Larry Reeves (larryr(AT)acm.org), Sep 13 2000
|
|
|
Search completed in 0.002 seconds
|
