login
This site is supported by donations 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)]. 1
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; internal format)
OFFSET

1,14

FORMULA

a(n)=A74389[n^2]

EXAMPLE

a(n) is odd because sigma[n^2] is odd; 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}]

CROSSREFS

Cf. A000005, A000010, A074389.

Sequence in context: A053878 A070672 A055061 * A081229 A109010 A117825

Adjacent sequences:  A074462 A074463 A074464 * A074466 A074467 A074468

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Aug 23 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 14:02 EST 2012. Contains 205811 sequences.