357761domain: NAppears in sequencesStrong pseudoprimes to base 2.at n=27A001262For p = prime(n), a(n) is the smallest base-2 pseudoprime N (that is, 2^(N-1) = 1 mod N) such that p divides N.at n=30A085999Triangle read by rows, T(n, k) = Sum_{j=0..k} |Stirling1(n, j)|.at n=50A349782