OFFSET
1,2
COMMENTS
LINKS
Rémy Sigrist, Table of n, a(n) for n = 1..10000
FORMULA
To compute a(n):
1) Factorize n: n = p_1^e_1 * ... * p_k^e_k,
2) Compute a(e_i) for i=1..k,
3) Sort the values computed at step 2 in descending order (keeping duplicates): you obtain, say, f_1 >= ... >= f_k,
4) a(n) = Prod_{i=1..k} prime(i)^f_i.
PROG
(PARI) a(n) = my (f=factor(n)); \
my (x=vecsort(vector(#f~, i, a(f[i, 2])), , 4)); \
return (prod(i=1, #x, prime(i)^x[i]))
CROSSREFS
KEYWORD
nonn
AUTHOR
Rémy Sigrist, Mar 27 2017
STATUS
approved