A319025 Primes p such that W_p == 2 (mod p), where W_p = A007619(n) and p = prime(n).

19, 1187, 14296621, 16556218163369

Offset: 1

Author

Felix Fröhlich, Sep 08 2018

Keywords

• nonn
• hard
• more

Comments

These are the members of René Gy's set W_2 (cf. Gy, 2018).

The sequence is complete to 2*10^13, with the higher terms coming from a list of primes with small Wilson quotients in the article by Costa, Gerbicz, and Harvey. - John Blythe Dobson, Jan 05 2021

Links

• Edgar Costa, Robert Gerbicz, and David Harvey, A search for Wilson primes, Mathematics of Computation 83 (2014) 3071-3091.
• R. Gy, Generalized Lerch Primes, Integers: Electronic Journal of Combinatorial Number Theory 18, (2018), #A10.

Crossrefs

Cf. A007540, A197632.

Programs

PARI

forprime(p=1, , if(Mod(((p-1)!+1)/p, p)==2, print1(p, ", ")))