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 A250407 #11 Oct 17 2017 04:01:21
%S A250407 2,3,5,7,13,61,71,79,157,281,563,1277,1777,2339,6311,8233,8543,11047,
%T A250407 22907,27689
%N A250407 Near-Wilson primes (p = prime(n) satisfying (p-1)! == -1-A250406(n)*p (mod p^2)) with A250406(n) < 10.
%C A250407 A250406(n) is essentially A007619(n) modulo A000040(n) (see Crandall et al. (1997), p. 442).
%H A250407 E. Costa, R. Gerbicz and D. Harvey, <a href="http://dx.doi.org/10.1090/S0025-5718-2014-02800-7">A search for Wilson primes</a>, Math. Comp., 83 (2014), 3071-3091.
%H A250407 R. Crandall, K. Dilcher and C. Pomerance, <a href="http://dx.doi.org/10.1090/S0025-5718-97-00791-6">A search for Wieferich and Wilson primes</a>, Math. Comp., 66 (1997), 433-449.
%o A250407 (PARI) forprime(p=1, 1e9, for(b=0, 9, if(Mod((p-1)!, p^2)==-1-b*p, print1(p, ", "); break({1}))))
%Y A250407 Cf. A007540, A246568, A250406.
%K A250407 nonn,hard,more
%O A250407 1,1
%A A250407 _Felix Fröhlich_, Nov 22 2014