2931542417

Appears in sequences

• Largest prime factor of 16^n + 1.at n=11A002590
• For p = prime(n), a(n) is the largest 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=22A086019
• Irregular triangle in which row n has all primes q such that prime(n)*q is a base-2 Fermat pseudoprime.at n=46A180471
• Largest prime factor of 4^n + 1.at n=22A274903
• a(n) = largest prime q such that q | 2^p - 2 and p - 1 | q - 1, where p = prime(n).at n=23A287945
• a(n) = gpf(lpf(2^prime(n) - 1) - 1) where prime(n) is the n-th prime.at n=23A292238
• a(n) is the largest prime factor of 2^(prime(n) - 1) - 1.at n=22A358699