The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A250407 Near-Wilson primes (p = prime(n) satisfying (p-1)! == -1-A250406(n)*p (mod p^2)) with A250406(n) < 10. 2
 2, 3, 5, 7, 13, 61, 71, 79, 157, 281, 563, 1277, 1777, 2339, 6311, 8233, 8543, 11047, 22907, 27689 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS A250406(n) is essentially A007619(n) modulo A000040(n) (see Crandall et al. (1997), p. 442). LINKS 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: A038965 A295738 A265781 * A055694 A249797 A309249 Adjacent sequences:  A250404 A250405 A250406 * A250408 A250409 A250410 KEYWORD nonn,hard,more AUTHOR Felix FrÃ¶hlich, Nov 22 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 13 02:09 EDT 2020. Contains 336441 sequences. (Running on oeis4.)