77158673929
domain: N
Appears in sequences
- Smallest primitive factor of 2^(2n+1) + 1.at n=31A002185
- Cyclotomic polynomials at x=-8.at n=21A020507
- 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=29A086019
- Aurifeuillian primes of the form 2^k+1.at n=23A153443
- Primes of the form Phi(phi(k),2), the phi(k)-th cyclotomic polynomial evaluated at 2, where phi is the Euler totient function.at n=17A211876
- Primes p such that the octal expansion of 1/p has a unique period length.at n=7A217611
- Largest prime factor of 8^n + 1.at n=21A274905
- a(n) = largest prime q such that q | 2^p - 2 and p - 1 | q - 1, where p = prime(n).at n=30A287945
- Primes of the form Phi(k, -8), where Phi is the cyclotomic polynomial.at n=3A291992
- Primes of the form Phi(k, -2), where Phi is the cyclotomic polynomial.at n=34A292006
- Primes of the form Phi(k, 8), where Phi is the cyclotomic polynomial.at n=4A292012
- a(n) = gpf(lpf(2^prime(n) - 1) - 1) where prime(n) is the n-th prime.at n=30A292238
- a(n) is the largest prime factor of 2^(prime(n) - 1) - 1.at n=29A358699
- Smallest primitive prime factor of 8^n-1.at n=41A379641