|
|
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 6, 1, 10, 1, 1, 1, 36, 1, 1, 1, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 100, 1, 1, 1, 22, 15, 1, 1, 216, 1, 10, 1, 26, 1, 36, 1, 196, 1, 1, 1, 30, 1, 1, 21, 1, 1, 1, 1, 34, 1, 1, 1, 6, 1, 1, 15, 38, 1, 1, 1, 1000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,12
|
|
COMMENTS
|
If n has unequal prime exponents (a term in A059404), then a(n) > 1; otherwise a(n) = 1.
|
|
LINKS
|
|
|
FORMULA
|
For n > 1, a(n) = A007947(n)^k where k is the difference between the greatest and least exponents in the prime power factorization of n.
|
|
EXAMPLE
|
|
|
MATHEMATICA
|
Table[Function[{r, s}, r^(Max[s] - Min[s])] @@ {Times @@ #[[All, 1]], #[[All, -1]]} &@ FactorInteger[n], {n, 120}] (* Michael De Vlieger, Jun 13 2024 *)
|
|
PROG
|
(PARI) a(n) = if (n==1, 1, my(f=factor(n)); (factorback(f[, 1]))^(vecmax(f[, 2])-vecmin(f[, 2]))); \\ Michel Marcus, Jun 14 2024
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|