[seqfan] Re: The primality test

[юрий герасимов]

Dear SequFans, what Carmichael number (> 10^8) is the least pseudoprime for the next primality test:
a(n) is numbers n such that the number of nonnegative m < n such that m^n == m (mod n) is equal to (the number of nonnegative m < n such that -m^n == m (mod n))*n and the number of nonnegative m < n such that m^k == m (mod n) is equal to (the number of nonnegative m < n such that -m^k == m (mod n))*k, where k = 2^ https://oeis.org/A007814 A007814 (n-1) + 1, where A007814(n) is the 2-adic valuation of n.
P. S. The weakness of MAGMA-calculator allowed me to limit muself only an interval of up to 10^8.
Sorry. Thanks. JSG.