Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A074465
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A074465 a(n)=GCD[n^2, sigma(n^2),phi(n^2)]. +0
2
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; listen)
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 this_sequence A081229 A109010 A117825

Adjacent sequences: A074462 A074463 A074464 this_sequence A074466 A074467 A074468

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 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research