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!)
A039768 Numbers k such that gcd(phi(k), k-1) = number of divisors of (k-1). 1
2, 3, 105, 133, 153, 185, 345, 377, 425, 585, 637, 665, 777, 805, 825, 873, 897, 905, 949, 1017, 1090, 1113, 1209, 1225, 1261, 1305, 1309, 1385, 1449, 1525, 1545, 1573, 1645, 1681, 1785, 1813, 1833, 1865, 1885, 1957, 1981, 2009, 2057, 2077, 2105 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
phi(105)=48, gcd(48,104)=8, 104 is divisible by {1,2,4,8,13,26,52,104}.
MATHEMATICA
aQ[n_] := GCD[EulerPhi[n], n - 1] == DivisorSigma[0, n - 1]; Select[Range[2, 2110], aQ] (* Amiram Eldar, Aug 28 2019 *)
CROSSREFS
Sequence in context: A041589 A371122 A371229 * A097653 A164926 A129729
KEYWORD
nonn,easy
AUTHOR
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 March 29 10:44 EDT 2024. Contains 371268 sequences. (Running on oeis4.)