1048573

Properties

Appears in sequences

• Largest prime <= 2^n.at n=19A014234
• Numerator of Sum_{i=1..n} i/2^i.at n=22A036295
• a(n) = 2^n - 3.at n=20A036563
• Primes of the form 2^k - 3.at n=8A050415
• Primes -p+2^n with smallest p prime, arising in A057674.at n=19A057674
• New record highs reached in A060030.at n=37A060482
• Primes p such that p+3 == 0 (mod phi(p+3)).at n=9A067932
• Numerator of the probability that the sum of n uniform picks on [0,1] is first greater than 2 (i.e., the sum of n-1 is not).at n=23A090137
• Smallest number having in binary representation a prefix of length n that is also a suffix of its successor.at n=19A091270
• Smallest prime factor of 2^n-3.at n=18A093810
• Largest prime factor of 2^n-3.at n=18A093817
• A Horadam-Jacobsthal sequence.at n=19A101622
• A006530(x)=2 is a local minimum if x=2^n. Running downward with argument x started at 2^n, the largest prime divisor should increase. The value of first peak is a(n).at n=19A102644
• Largest prime <= 4^n.at n=9A104089
• Prime nearest to 2^n. In case of a tie, choose the smaller.at n=20A117387
• Largest prime factor of the odd Catalan number A038003(n).at n=17A120274
• Primes in the new Mersenne conjecture; odd primes of the form 2^k+-1 or 4^k+-3.at n=21A122834
• Least prime of the form x^n-x-1.at n=18A126439
• Largest prime <= 2^((n+1)/2).at n=38A133225
• a(n) = 3*a(n-1) - 3*a(n-2) + 2*a(n-3), with a(0) = 4, a(1) = 2, a(2) = 1.at n=20A133455