OFFSET
1,1
COMMENTS
Beeger proved in 1950 that if p < q < r are primes such that p*q*r is a Carmichael number, then q < 2p^2 and r < p^3. Therefore there is a finite number of 3-Carmichael numbers which divisible by a given prime.
The terms were calculated using Pinch's tables of Carmichael numbers (see link below).
REFERENCES
N. G. W. H. Beeger, "On composite numbers n for which a^n == 1 (mod n) for every a prime to n", Scripta Mathematica, Vol. 16 (1950), pp. 133-135.
LINKS
R. G. E. Pinch, Tables relating to Carmichael numbers.
CROSSREFS
KEYWORD
nonn
AUTHOR
Amiram Eldar, Aug 03 2017
STATUS
approved