|
|
|
|
1, 1, 1, 2, 1, 1, 1, 4, 3, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 9, 1, 1, 1, 1, 16, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 32, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 1, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
a[n_] := Module[{f = FactorInteger[n], e}, e = Min[f[[;; , 2]]] - 1; f[[;; , 2]] = e; Times @@ Power @@@ f]; Array[a, 100] (* Amiram Eldar, Feb 12 2023 *)
|
|
PROG
|
(PARI)
A007947(n) = factorback(factorint(n)[, 1]);
A051904(n) = if((1==n), 0, vecmin(factor(n)[, 2]));
(PARI) a(n) = {if(n==1, 1, my(f = factor(n), e = vecmin(f[, 2]) - 1); prod(i = 1, #f~, f[i, 1]^e)); } \\ Amiram Eldar, Feb 12 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|