OFFSET
1,2
COMMENTS
A prime p is a Wilson prime if p divides its Wilson quotient A007619. A number n is a Wilson number if n divides its generalized Wilson quotient A157249.
The sequence contains all Wilson numbers <= 5 x 10^8. Heuristics suggest that #(Wilson numbers < N) is about (6/pi^2) log N, for large N.
A Wilson number is prime if and only if it is a Wilson prime A007540. Only three are known: 5, 13, 563.
The first composite Wilson number 5971 was discovered by Kloss, the others by Agoh, Dilcher, and Skula. Every known composite Wilson number n has at least two odd prime factors, so e(n) = -1.
For additional references and links, see A007540.
REFERENCES
L. E. Dickson, History of the Theory of Numbers, vol. 1, Divisibility and Primality, Chelsea, New York, 1966, p. 65.
LINKS
T. Agoh, K. Dilcher, and L. Skula, Wilson quotients for composite moduli, Math. Comp. 67 (1998), 843-861.
K. E. Kloss, Some Number-Theoretic Calculations, J. Research of the National Bureau of Standards-B. Mathematics and Mathematical Physics, Vol. 69B, No. 4 (1965), 335-336.
Jonathan Sondow, Lerch Quotients, Lerch Primes, Fermat-Wilson Quotients, and the Wieferich-non-Wilson Primes 2, 3, 14771, in Proceedings of CANT 2011, arXiv:1110.3113 [math.NT], 2011-2012.
Jonathan Sondow, Lerch Quotients, Lerch Primes, Fermat-Wilson Quotients, and the Wieferich-non-Wilson Primes 2, 3, 14771, Combinatorial and Additive Number Theory, CANT 2011 and 2012, Springer Proc. in Math. & Stat., vol. 101 (2014), pp. 243-255.
FORMULA
EXAMPLE
MATHEMATICA
f[n_] := Times @@ Select[Range[n], CoprimeQ[n, #]&];
e[1|2|4] = 1; e[n_] := If[MatchQ[FactorInteger[n], {{_?OddQ, _}} | {{2, 1}, {_, _}}], 1, -1];
WilsonQ[n_] := IntegerQ[(f[n] + e[n])/n^2];
Reap[For[k = 1, k < 10^7, k++, If[WilsonQ[k], Print[k]; Sow[k]]]][[2, 1]] (* Jean-François Alcover, Dec 11 2018 *)
CROSSREFS
KEYWORD
more,nonn
AUTHOR
Jonathan Sondow and Wadim Zudilin, Feb 27 2009
STATUS
approved