login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A074389 a(n)=GCD[w, sigma(n),Phi(n)]=GCD[A000005(n), A000010(n),n]. 3
1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 4, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 4, 1, 2, 1, 4, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 6, 1, 4, 3, 2, 1, 4, 1, 1, 1, 2, 1, 6, 1, 8, 1, 2, 1, 4, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 2, 1, 4, 1, 6, 1, 2, 1, 2, 1, 4, 1, 2, 1, 4, 1, 6, 1, 4, 1, 2, 1, 4, 1, 1, 3, 1, 1, 2, 1, 2, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,6

MATHEMATICA

Table[Apply[GCD, {w, DivisorSigma[1, w], EulerPhi[w]}], {w, 1, 128}]

CROSSREFS

Cf. A000005, A000010, A073815, A050399, A009195, A009194.

Sequence in context: A138010 A167204 A104306 * A051119 A159269 A186728

Adjacent sequences:  A074386 A074387 A074388 * A074390 A074391 A074392

KEYWORD

easy,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 14 07:40 EST 2012. Contains 205597 sequences.