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.
%I A319025 #13 Jan 24 2021 14:56:19 %S A319025 19,1187,14296621,16556218163369 %N A319025 Primes p such that W_p == 2 (mod p), where W_p = A007619(n) and p = prime(n). %C A319025 These are the members of René Gy's set W_2 (cf. Gy, 2018). %C A319025 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 %H A319025 Edgar Costa, Robert Gerbicz, and David Harvey, <a href="https://doi.org/10.1090/S0025-5718-2014-02800-7">A search for Wilson primes</a>, Mathematics of Computation 83 (2014) 3071-3091. %H A319025 R. Gy, <a href="http://math.colgate.edu/~integers/s10/s10.mail.html">Generalized Lerch Primes</a>, Integers: Electronic Journal of Combinatorial Number Theory 18, (2018), #A10. %o A319025 (PARI) forprime(p=1, , if(Mod(((p-1)!+1)/p, p)==2, print1(p, ", "))) %Y A319025 Cf. A007540, A197632. %K A319025 nonn,hard,more %O A319025 1,1 %A A319025 _Felix Fröhlich_, Sep 08 2018