4294967291

Appears in sequences

• Largest prime <= 2^n.at n=31A014234
• Numbers k such that phi(k + 4) | sigma(k) + 4.at n=15A015870
• Primes -p+2^n with smallest p prime, arising in A057674.at n=31A057674
• Least k such that n! divides C(2k,k).at n=31A072120
• 2^(n-1) - (prime(n) mod n).at n=32A077686
• Largest prime <= 4^n.at n=15A104089
• Prime nearest to 2^n. In case of a tie, choose the smaller.at n=32A117387
• Least prime of the form x^n-x-1.at n=14A126439
• a(n) = greatest prime <= 2^(2^n).at n=5A132358
• Primes of the form 2^n-5.at n=9A156560
• Numbers n such that n and n+5 are prime powers.at n=15A164573
• a(n) = 2^(2^n) - 5.at n=5A232460
• Lesser prime of third Mersenne prime pair {2^m - 5, 5*2^m - 1}.at n=5A238751
• Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 825", based on the 5-celled von Neumann neighborhood.at n=31A290519
• a(n) is the largest prime 2^(n-1) <= p < 2^n maximizing the Hamming weight of all primes in this interval.at n=30A333877
• Prime nearest to 2^n. In case of a tie, choose the larger.at n=32A356434