login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A319025
Primes p such that W_p == 2 (mod p), where W_p = A007619(n) and p = prime(n).
0
19, 1187, 14296621, 16556218163369
OFFSET
1,1
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.
PROG
(PARI) forprime(p=1, , if(Mod(((p-1)!+1)/p, p)==2, print1(p, ", ")))
CROSSREFS
Sequence in context: A063442 A091750 A316332 * A253127 A078955 A107673
KEYWORD
nonn,hard,more
AUTHOR
Felix Fröhlich, Sep 08 2018
STATUS
approved