Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074389
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074389 a(n)=GCD[w, sigma(n),Phi(n)]=GCD[A000005(n), A000010(n),n]. +0
4
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; listen)
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 this_sequence A051119 A159269 A009191

Adjacent sequences: A074386 A074387 A074388 this_sequence A074390 A074391 A074392

KEYWORD

easy,nonn

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research