481573domain: NAppears in sequencesNumbers k > 1 such that 2^k == 2 (mod k) and gcd(k, 3^k - 3) = 1.at n=12A300762Numbers k such that 2^(k-1) == 1 (mod k) and lpf(k)-1 does not divide k-1.at n=20A316906Numbers k such that 2^(k-1) == 1 (mod k) and p-1 does not divide k-1 for every prime p dividing k.at n=17A316907