62020897

Properties

Appears in sequences

• For p = prime(n), a(n) is the smallest prime q such that pq is a base-2 pseudoprime; that is, 2^(pq-1) = 1 mod pq; a(n) is 0 if no such prime exists.at n=39A085012
• Smallest prime factor q of (2^(p-1)-1) / (3*p) with prime p such that q is greater than p (increasing p, cf. A359387).at n=7A359650
• Prime numbersat n=3674767