14680063

Properties

Appears in sequences

• Primes of the form 7*2^k - 1.at n=4A050523
• Smallest prime with Hamming weight n (i.e., with exactly n 1's when written in binary).at n=22A061712
• a(n) = n*8^n - 1.at n=6A064754
• Permutation of N induced by rotating the node 1 (the top node) right in the infinite planar binary tree shown at A065658.at n=43A065660
• Permutation of N induced by rotating the node 6 left in the infinite planar binary tree shown at A065658.at n=56A065671
• Least k such that A072084(k) = n.at n=22A072087
• Primes of the form 2^r*7^s - 1.at n=24A077314
• a(n) is the smallest prime such that the number of 1's in its binary expansion is equal to the n-th prime.at n=8A081093
• Let t(x) be the highest power of 2 which divides x+1. Then a(1)=3; a(n) is the least prime p for which t(p) > t(a(n-1)).at n=12A084924
• a(n) = 7*2^n - 1.at n=21A086224
• a(0) = 2; for n>=1, a(n) = smallest prime p such that p+1 is divisible by an n-th power > 1.at n=20A087522
• a(0) = 2; for n>=1, a(n) = smallest prime p such that p+1 is divisible by an n-th power > 1.at n=21A087522
• Smallest prime with exactly n consecutive ones in the longest run of ones in its binary expansion.at n=20A090593
• Smallest prime between 2^n and 2^(n+1), having a maximal number of 1's in binary representation.at n=22A091938
• Duplicate of A081093.at n=8A093535
• 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=21A118883
• Smallest prime of the form k*2^n - 1, for k >= 2.at n=19A127581
• Smallest prime of the form k*2^n - 1, for k >= 2.at n=20A127581
• Smallest prime of the form k*2^n - 1, for k >= 2.at n=21A127581
• a(n) = the smallest prime number of the form k*2^n - 1, for k >= 1.at n=20A127582