|
|
A020667
|
|
Least n-th power containing every digit.
|
|
2
|
|
|
1023456789, 1026753849, 12584301976, 338920744561, 2817036000549, 16157819263041, 1727094849536, 13685690504052736, 1628413597910449, 3656158440062976, 2384185791015625, 129746337890625, 1490116119384765625, 168377826559400929, 2862423051509815793
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
It is extremely probable that a(n) = 2^n for all n >= 169.
|
|
LINKS
|
|
|
PROG
|
(Python)
def a(n):
if n == 1: return 1023456789
a020667n = 2
while not(len(set(str(a020667n**n))) == 10): a020667n += 1
return a020667n**n
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|