524269

Properties

Appears in sequences

• a(n) = 2^n - n.at n=19A000325
• Primes -p+2^n with smallest p prime, arising in A057674.at n=18A057674
• Primes of the form 2^p - p where p is prime.at n=3A057678
• Primes of the form 2^i*3^j - (i+j) with i, j >= 0.at n=20A069356
• a(n) = 2^(2*n+1)*Sum_{k=1..2*n} binomial(2*n+1,k)*Bernoulli(k)/2^k.at n=8A069993
• Prime preceding the n-th Mersenne prime.at n=6A073715
• a(n) = ceiling(n^(1/n))^n - n.at n=18A076878
• Primes of the form 2^k - k.at n=4A081296
• a(n) = 3*a(n-1) - a(n-2) - 3*a(n-3) + 2*a(n-4).at n=18A084173
• a(n) = 2^prime(n)-prime(n).at n=7A100105
• Largest prime factor of the odd Catalan number A038003(n).at n=16A120274
• Double, add 0, double, add 1, double, add 2, double, add 3, etc.at n=36A147678
• Least prime divisor of 2^n - n which does not divide any 2^k - k with 0 < k < n, or 1 if such a primitive prime divisor of 2^n - n does not exist.at n=18A242292
• Primes with a prime number of binary digits, and with a prime number of 1's and a prime number of 0's.at n=42A272478
• a(n) = Numerator of (0 followed by 1's) - n/2^n.at n=19A273153
• a(n) is the least prime p such that Omega(p + n) = n where Omega is A001222, or 0 if no such prime exists.at n=18A345740
• Primes that can be written as 2^x - p where p is a prime and x is a multiple of p.at n=7A358087
• Greatest prime dividing 2^n - n for n>=2; a(1) = 1.at n=18A359684
• a(n) is the least prime p such that p and the next prime > p have exactly n common 1's in their binary expansion.at n=16A374178
• Prime numbersat n=43389