25080101domain: NAppears in sequencesNumbers k (between 2^(m-1) and 2^m) such that 2^(k-1) == 1 (mod k) and 2^(k-1-m) == k - 2^p (mod k) for some p > 0 with 2^p < k.at n=41A167612Lesser of overpseudo-twin-primes to base 2 defined in Comment.at n=23A195468Strong pseudoprimes (base 2) that become prime when two is added.at n=11A230484