login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A353643 The greatest common divisor of phi(n) and phi(sigma(n)). 4
1, 1, 2, 2, 2, 2, 2, 4, 6, 2, 2, 4, 6, 2, 8, 2, 2, 6, 2, 4, 4, 2, 2, 8, 10, 12, 2, 12, 4, 8, 2, 4, 4, 2, 8, 12, 18, 2, 24, 8, 4, 4, 2, 4, 24, 2, 2, 4, 6, 20, 8, 6, 2, 2, 8, 8, 4, 4, 2, 16, 30, 2, 12, 2, 24, 4, 2, 4, 4, 24, 2, 24, 36, 36, 20, 12, 4, 24, 2, 4, 2, 4, 2, 24, 4, 2, 8, 8, 8, 24, 24, 4, 4, 2, 8, 8, 6, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = gcd(A000010(n), A062401(n)).
a(n) = gcd(A000010(n), A353636(n)) = gcd(A062401(n), A353636(n)).
a(n) = A000010(n) / A353644(n).
a(n) = A062401(n) / A353646(n).
MATHEMATICA
a[n_] := GCD[EulerPhi[n], EulerPhi[DivisorSigma[1, n]]]; Array[a, 100] (* Amiram Eldar, May 06 2022 *)
PROG
(PARI) A353643(n) = gcd(eulerphi(sigma(n)), eulerphi(n));
CROSSREFS
Sequence in context: A029103 A175732 A327817 * A168260 A008737 A244460
KEYWORD
nonn
AUTHOR
Antti Karttunen, May 06 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 9 17:14 EDT 2024. Contains 372354 sequences. (Running on oeis4.)