|
Search: id:A061381
|
|
|
| A061381 |
|
Smallest "inconsummate number" in base n greater than in the previous base. |
|
+0
1
|
|
| 13, 17, 29, 46, 64, 86, 105, 136, 161, 200, 229, 276, 309, 362, 419, 460, 505, 572, 621, 694, 749, 830, 889, 978, 1054, 1136, 1205, 1306, 1381, 1490, 1569, 1684, 1769, 1892, 1999, 2112, 2205, 2342, 2441, 2584, 2689, 2840, 2949, 3106, 3269, 3386, 3505, 3678
(list; graph; listen)
|
|
|
OFFSET
|
2,1
|
|
|
LINKS
|
David Radcliffe, Inconsummate Numbers
|
|
MATHEMATICA
|
n = 1; Do[ While[k = n; While[ Apply[ Plus, IntegerDigits[k, b] ]*n != k && k < 100n, k += n]; k != 100n, n++ ]; Print[n], {b, 2, 60} ]
|
|
CROSSREFS
|
Cf. A052491.
Sequence in context: A156343 A154762 A079348 this_sequence A048520 A033210 A107159
Adjacent sequences: A061378 A061379 A061380 this_sequence A061382 A061383 A061384
|
|
KEYWORD
|
base,easy,nice,nonn
|
|
AUTHOR
|
Robert G. Wilson v (rgwv(AT)rgwv.com), Jun 08 2001
|
|
|
Search completed in 0.002 seconds
|
