1746289domain: NAppears in sequencesFermat pseudoprimes to base 2 with three prime factors divisible by a smaller Fermat pseudoprime to base 2.at n=26A215944Composite integers k satisfying 2^d == 2^(k/d) (mod k) for all d|k and that are not Super-Poulet (A050217).at n=17A291602