|
|
A133509
|
|
Numbers k such that m=1 is the only number for which the sum of digits of m^k equals m.
|
|
7
|
|
|
0, 105, 164, 186, 194, 206, 216, 231, 254, 282, 285, 302, 314, 324, 374, 386, 402, 416, 456, 468, 491, 504, 521, 552, 588, 606, 610, 615, 629, 651, 656, 657, 696, 759, 794, 830, 842, 854, 870, 903, 906, 954, 956, 981, 998, 1029, 1064, 1079, 1082, 1109, 1112, 1131
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
FORMULA
|
|
|
PROG
|
(Python)
def ok(n):
d, lim = 1, 1
while lim < n*9*d: d, lim = d+1, lim*10
return not any(sum(map(int, str(k**n))) == k for k in range(2, lim+1))
for k in range(195):
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Description improved by T. D. Noe, Nov 26 2008
|
|
STATUS
|
approved
|
|
|
|