OFFSET
1,1
COMMENTS
Most Carmichael numbers are congruent to 1 modulo 4.
This is a subsequence of A167181: if a prime p | a(n), (p-1) | (a(n)-1) by Korselt's criterion. But a(n)-1 is 2 mod 4, so p-1 cannot be 0 mod 4. Hence all primes dividing a(n) are 3 mod 4. - Charles R Greathouse IV, Jan 27 2012
Pinch call the intersection of A007304 with this sequence C3, which are precisely those numbers which pass a Rabin-Miller test to a random base with probability 1/4. The first member of this sequence not in C3 is a(16) = 7 * 11 * 19 * 103 * 9419. - Charles R Greathouse IV, Jan 27 2012
Wright proves that this sequence is infinite, and in particular there are more than x^(k/(log log log x)^2) terms up to x for some k and large enough x. - Charles R Greathouse IV, Nov 09 2015
LINKS
Donovan Johnson and Charles R Greathouse IV, Table of n, a(n) for n = 1..15447 (first 6838 terms from Johnson)
Charles R Greathouse IV, GP script to compute terms
Charles R Greathouse IV, Alternate GP script to compute terms
R. G. E. Pinch, The Carmichael numbers up to 10^15, Mathematics of Computation 61:203 (1993), pp. 381-391.
Thomas Wright, Infinitely many Carmichael numbers in arithmetic progressions, Bull. London Math. Soc. 45:5 (2013), pp. 943-952.
MATHEMATICA
Select[4Range[10^4] + 3, (!PrimeQ[#] && IntegerQ[(# - 1)/CarmichaelLambda[#]]) &]
PROG
(PARI) Korselt(n)=my(f=factor(n)); for(i=1, #f[, 1], if(f[i, 2]>1||(n-1)%(f[i, 1]-1), return(0))); 1
p=5; forprime(q=7, 1e7, forstep(n=if(p%4==3, p+4, p+2), q-2, 4, if(Korselt(n), print1(n", "))); p=q) \\ Charles R Greathouse IV, Jan 27 2012
CROSSREFS
KEYWORD
nonn
AUTHOR
José María Grau Ribas, Jan 27 2012
EXTENSIONS
a(7)-a(40) from Charles R Greathouse IV, Jan 27 2012
STATUS
approved