OFFSET
1,1
LINKS
S. Colton, Refactorable Numbers - A Machine Invention, J. Integer Sequences, Vol. 2, 1999.
Joshua Zelinsky, Tau Numbers: A Partial Proof of a Conjecture and Other Results , Journal of Integer Sequences, Vol. 5 (2002), Article 02.2.8
FORMULA
a(n) = A281495(n)^n.
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
Altug Alkan, Jan 21 2017
EXTENSIONS
More terms from Giovanni Resta, Jan 22 2017
STATUS
approved