cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A103665 Primes p such that the number of divisors of p-1 is greater than the number of divisors of p+1.

Original entry on oeis.org

13, 31, 37, 43, 61, 67, 73, 97, 101, 109, 113, 127, 151, 157, 163, 181, 193, 211, 229, 241, 257, 271, 277, 281, 283, 313, 331, 337, 353, 373, 379, 397, 401, 409, 421, 433, 457, 463, 487, 521, 523, 541, 547, 571, 577, 601, 613, 617, 631, 641, 661, 673, 677
Offset: 1

Views

Author

Hugo Pfoertner, Feb 19 2005

Keywords

Comments

Mathematica coding by Wouter Meeussen and Robert G. Wilson v.

Examples

			a(1)=13 because d(12)=6 > d(14)=4.
		

Crossrefs

Cf. A008328 number of divisors of p-1, A008329 number of divisors of p+1, A103664, A103666, A103667.

Programs

  • Mathematica
    Select[Prime[Range[2, 140]], Length[Divisors[ # - 1]] > Length[Divisors[ # + 1]] &]
    Select[Prime[Range[200]],DivisorSigma[0,#-1]>DivisorSigma[0,#+1]&] (* Harvey P. Dale, Aug 21 2022 *)
  • PARI
    forprime (k=2,700,if(numdiv(k-1)>numdiv(k+1),print1(k,", ")))
    \\ Hugo Pfoertner, Nov 30 2017