Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076486
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076486 Solutions to GCD[sigma[x],phi[x]]<GCD[sigma[core(x)],Phi[core(x)]], i.e. when A009223[x]<A066086 or if A066087[x]<0. +0
2
9, 25, 28, 36, 45, 50, 52, 75, 76, 81, 84, 90, 98, 100, 117, 121, 124, 144, 148, 150, 153, 156, 175, 180, 208, 225, 228, 234, 242, 244, 245, 252, 261, 268, 275, 289, 292, 300, 304, 306, 316, 324, 325, 333, 338, 360, 364, 369, 372, 380, 388, 392, 400, 405, 412 (list; graph; listen)
OFFSET

1,1

EXAMPLE

n=9: sigma[9]=13,phi[9]=6, GCD[13,6]=1, core[9]=3, sigma[3]=4,phi[3]=2, GCD[4,2]=2

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]]] Do[s1=g1[n]; s2=g2[n]; If[Greater[s2, s1], Print[n]], {n, 1, 256}]

CROSSREFS

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

Sequence in context: A068583 A074852 A020252 this_sequence A068529 A096059 A065772

Adjacent sequences: A076483 A076484 A076485 this_sequence A076487 A076488 A076489

KEYWORD

nonn

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Oct 17 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 December 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research