A250407 Near-Wilson primes (p = prime(n) satisfying (p-1)! == -1-A250406(n)*p (mod p^2)) with A250406(n) < 10.

2, 3, 5, 7, 13, 61, 71, 79, 157, 281, 563, 1277, 1777, 2339, 6311, 8233, 8543, 11047, 22907, 27689

Offset

1,1

Comments

A250406(n) is essentially A007619(n) modulo A000040(n) (see Crandall et al. (1997), p. 442).

Links

Table of n, a(n) for n=1..20.

E. Costa, R. Gerbicz and D. Harvey, A search for Wilson primes, Math. Comp., 83 (2014), 3071-3091.

R. Crandall, K. Dilcher and C. Pomerance, A search for Wieferich and Wilson primes, Math. Comp., 66 (1997), 433-449.

Prog

(PARI) forprime(p=1, 1e9, for(b=0, 9, if(Mod((p-1)!, p^2)==-1-b*p, print1(p, ", "); break({1}))))

Crossrefs

Cf. A007540, A246568, A250406.

Sequence in context: A295738 A265781 A344360 * A055694 A249797 A346686

Adjacent sequences: A250404 A250405 A250406 * A250408 A250409 A250410

Keyword

nonn,hard,more

Author

Felix Fröhlich, Nov 22 2014

Status

approved