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!)
A074465 a(n) = gcd(n^2, sigma(n^2), phi(n^2)). 3
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 39, 1, 1, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 39, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 7, 11, 1, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,14
COMMENTS
a(n) is odd because sigma(n^2) is odd;.
LINKS
FORMULA
a(n) = A074389(n^2).
EXAMPLE
For n=14: gcd(196,399,84) = 7 = a(14).
MATHEMATICA
Table[Apply[GCD, {w^2, DivisorSigma[1, w^2], EulerPhi[w^2]}], {w, 1, 128}]
PROG
(PARI) A074465(n) = gcd([n^2, sigma(n^2), eulerphi(n^2)]); \\ Antti Karttunen, Sep 07 2018
CROSSREFS
Sequence in context: A239700 A304906 A055061 * A081229 A109010 A268354
KEYWORD
nonn
AUTHOR
Labos Elemer, Aug 23 2002
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 April 20 00:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)