Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066086
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066086 GCD[A048250(n), A023900(n)] = GCD[Sigma[A007947(n)],Phi[A007947(n)]] = GCD[A000203[A007947(n)], A000010[A007947(n)]]. +0
6
1, 1, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 6, 8, 1, 2, 2, 2, 2, 4, 2, 2, 2, 2, 6, 2, 6, 2, 8, 2, 1, 4, 2, 24, 2, 2, 6, 8, 2, 2, 12, 2, 2, 8, 2, 2, 2, 2, 2, 8, 6, 2, 2, 8, 6, 4, 2, 2, 8, 2, 6, 4, 1, 12, 4, 2, 2, 4, 24, 2, 2, 2, 6, 8, 6, 12, 24, 2, 2, 2, 2, 2, 12, 4, 6, 8, 2, 2, 8, 8, 2, 4, 2, 24, 2, 2, 6, 4 (list; graph; listen)
OFFSET

1,3

EXAMPLE

Frequently equals A009223 (i.e. GCD of sigma and phi of n), but A066086 and A009223 are not identical.

n=12: GCD[sigma[n],phi[n]]>GCD[sigma[core(n)],Phi[core(n)]],

MATHEMATICA

ffi[x_] := Flatten[FactorInteger[x]] lf[x_] := Length[FactorInteger[x]] ba[x_] := Table[Part[ffi[x], 2*w-1], {w, 1, lf[x]}] cor[x_] := Apply[Times, ba[x]] g1[x_] := GCD[DivisorSigma[1, x], EulerPhi[x]] g2[x_] := GCD[DivisorSigma[1, cor[x]], EulerPhi[cor[x]]] Table[g2[w], {w, 1, 128}]

CROSSREFS

Cf. A048250, A023900, A000203, A007947, A000010, A009223, A066087.

Sequence in context: A099812 A068068 A092505 this_sequence A160520 A145866 A103318

Adjacent sequences: A066083 A066084 A066085 this_sequence A066087 A066088 A066089

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Dec 04 2001

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