Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074466
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074466 a(n)=GCD[n^3, sigma(n^3),phi(n^3)]. +0
1
1, 1, 1, 1, 1, 24, 1, 1, 1, 20, 1, 8, 1, 8, 15, 1, 1, 3, 1, 4, 1, 8, 1, 24, 1, 4, 1, 16, 1, 1800, 1, 1, 3, 4, 25, 1, 1, 8, 1, 4, 1, 24, 1, 8, 3, 8, 1, 8, 1, 5, 9, 4, 1, 12, 1, 16, 1, 4, 1, 480, 1, 8, 1, 1, 65, 72, 1, 4, 3, 200, 1, 3, 1, 4, 5, 8, 1, 24, 1, 4, 1, 4, 1, 64, 5, 8, 3, 88, 1, 180, 7, 16, 1 (list; graph; listen)
OFFSET

1,6

FORMULA

a(n)=A74389[n^3]

EXAMPLE

n=10:GCD[1000,2340,400]=20=a(10)

MATHEMATICA

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

CROSSREFS

Cf. A000005, A000010, A074389, A074465.

Sequence in context: A040582 A102914 A040583 this_sequence A040579 A040580 A040578

Adjacent sequences: A074463 A074464 A074465 this_sequence A074467 A074468 A074469

KEYWORD

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