167772161

Properties

Appears in sequences

• Prime factors of Fermat numbers.at n=16A023394
• Smallest prime of form 2^n*k + 1.at n=24A035089
• Smallest prime of form 2^n*k + 1.at n=23A035089
• Smallest prime of form 2^n*k + 1.at n=25A035089
• Primes of form 5*2^n+1.at n=5A050526
• Minimal 2^n safe-primes: a(n) = 2^n*A051886(n) + 1 (a prime number).at n=25A051900
• a(n) is the least prime p such that p-1 is divisible by 2^n and not by 2^(n+1).at n=25A057775
• Smallest prime with leading digits the same as those of n^n.at n=7A068840
• Smallest prime larger than 2^n whose digits begin with those of 2^n.at n=24A068842
• Smallest prime with same leading digits as 8^n.at n=8A068848
• Smallest prime of the form k*n^n + 1.at n=7A070855
• Primes p for which the period of 1/p is a power of 2.at n=25A072982
• Smallest prime p with bigomega(p-1)=n, where bigomega(m)=A001222(m) is the number of prime divisors of m (counted with multiplicity).at n=26A073919
• Primes that divide Fibonacci number F(2^k) for some k.at n=12A074714
• Primes of the form 2^r*5^s + 1.at n=25A077497
• Smallest prime which is 1 more than the product of n (not necessarily distinct) composite numbers.at n=13A081546
• Using Euler's 6-term sequence A014556, we define the partial recurrence relation a(0)=2, a(1)=3, a(2)=5; a(k) = 2*a(k-1) - 1 - (-2)^(k-2), 3 <= k <= 5.at n=27A082605
• a(0) = 6; for n>0, a(n) = 2*a(n-1) - 1.at n=25A083575
• Duplicate of A051900.at n=25A084706
• Smallest prime with exactly n consecutive zeros in the longest run of zeros in its binary expansion.at n=24A090587