|
|
A362414
|
|
a(n) = gcd(n, phi(n)^2) / gcd(n, phi(n)).
|
|
1
|
|
|
1, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 1, 1, 1, 1, 1, 5, 1, 3, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 7, 5, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 5, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 7, 3, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,4
|
|
COMMENTS
|
a(n) = 1 if n is squarefree.
|
|
LINKS
|
|
|
FORMULA
|
1 <= a(n) <= sqrt(n). The lower bound is sharp (squarefree numbers), as is the upper bound (squares of primes). - Charles R Greathouse IV, May 03 2023
|
|
MATHEMATICA
|
A362414[n_]:=With[{p=EulerPhi[n]}, GCD[n, p^2]/GCD[n, p]];
|
|
PROG
|
(Magma) [Gcd(n, EulerPhi(n)^2) / Gcd(n, EulerPhi(n)): n in [1..100]];
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|