|
|
A281389
|
|
Least k > 1 such that refactorable number k is an n-th power.
|
|
0
|
|
|
2, 9, 8, 625, 7776, 117649, 128, 6561, 1000000000, 25937424601, 362797056, 23298085122481, 2541865828329, 29192926025390625, 32768, 48661191875666868481, 16926659444736, 104127350297911241532841, 10000000000000000000, 278218429446951548637196401
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
a(4) = 625 because 625 = 5^4 is the least fourth power refactorable number that is greater than 1.
|
|
PROG
|
(PARI) isA033950(n) = n % numdiv(n) == 0;
a(n) = {my(k=2); while (!isA033950 (k^n), k++); k^n; }
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|