OFFSET
1,1
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..236823
Gorgui-Naguib and Dlay, Properties of the Euler totient function modulo 24 and some of its cryptographic implications, Cryptology Research Group, University of Newcastle-upon-Tyne, UK.
Andrew Granville and Carl Pomerance, Two contradictory conjectures concerning Carmichael numbers, Math. Comp. 71 (2002), pp. 883-90.
F. Richman, Primality testing with Fermat's little theorem
EXAMPLE
561 is 9 modulo 24, 1105 is 1 modulo 24, 1729 is 1 modulo 24, etc.
MATHEMATICA
CarmichaelNbrQ[n_] := ! PrimeQ@ n && Mod[n, CarmichaelLambda@ n] == 1; Select[ Range@ 10000000, Mod[#, 24] > 1 && CarmichaelNbrQ@# &] (* Robert G. Wilson v, Aug 23 2012 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Rob Hoogers (chimera(AT)chimera.fol.nl), Jul 26 2004
EXTENSIONS
Recomputed and edited by N. J. A. Sloane, Aug 02 2010
STATUS
approved