|
|
A327499
|
|
Quotient of n over the maximum divisor of n whose prime multiplicities are distinct.
|
|
12
|
|
|
1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 2, 1, 1, 1, 6, 1, 1, 3, 2, 5, 2, 1, 2, 3, 1, 1, 6, 1, 1, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 5, 1, 3, 2, 1, 3, 1, 2, 1, 1, 5, 6, 1, 1, 3, 10, 1, 1, 1, 2, 1, 1, 7, 6, 1, 1, 1, 2, 1, 3, 5, 2, 3, 1, 1, 2, 7, 1, 3, 2, 5, 1, 1, 1, 1, 2, 1, 6, 1, 1, 15
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,6
|
|
COMMENTS
|
A number's prime multiplicities are also called its (unsorted) prime signature.
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
The maximum such divisor of 60 is 20, so a(60) = 3.
|
|
MATHEMATICA
|
Table[n/Max[Select[Divisors[n], UnsameQ@@Last/@FactorInteger[#]&]], {n, 100}]
|
|
PROG
|
(PARI)
A351564(n) = issquarefree(factorback(apply(e->prime(e), (factor(n)[, 2]))));
|
|
CROSSREFS
|
See link for additional cross-references.
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|