The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A073812 Number of common divisors of sigma(n) and phi(n). 1
1, 1, 2, 1, 2, 2, 2, 1, 1, 2, 2, 3, 2, 4, 4, 1, 2, 2, 2, 2, 3, 2, 2, 3, 1, 4, 2, 3, 2, 4, 2, 1, 3, 2, 8, 1, 2, 4, 4, 2, 2, 6, 2, 3, 4, 2, 2, 3, 2, 1, 4, 2, 2, 4, 4, 8, 3, 2, 2, 4, 2, 4, 3, 1, 6, 3, 2, 2, 3, 8, 2, 2, 2, 4, 3, 3, 6, 8, 2, 2, 1, 2, 2, 4, 3, 4, 4, 6, 2, 4, 4, 3, 3, 2, 8, 3, 2, 2, 6, 1, 2, 4, 2, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = Card[Intersection[D[A000203(n)], D[A000010(n)]]].
EXAMPLE
n=36: sigma(36)=91; phi(36)=12; Intersection[{1,7,13,91},{1,2,3,4,6,12}]={1}, so a(36)=1.
MATHEMATICA
g1[x_] := Divisors[DivisorSigma[1, x]] g2[x_] := Divisors[EulerPhi[x]] ncd[x_] := Length[Intersection[g1[x], g2[x]]] Table[ncd[w], {w, 1, 128}]
a[n_] := DivisorSigma[0, GCD[DivisorSigma[1, n], EulerPhi[n]]]; Array[a, 100] (* Amiram Eldar, Oct 18 2019 *)
CROSSREFS
Sequence in context: A336476 A082064 A082055 * A009223 A110244 A309020
KEYWORD
nonn,easy
AUTHOR
Labos Elemer, Aug 13 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 23 00:54 EDT 2024. Contains 372758 sequences. (Running on oeis4.)