738197503

Properties

Appears in sequences

• Primes of the form 11*2^k - 1.at n=1A050525
• Start with n, apply k->2k+1 until reach new record prime; sequence gives record primes.at n=10A051919
• Riesel problem: start with n; repeatedly double and add 1 until reach a prime. Sequence gives a(n) = prime reached, or 0 if no prime is ever reached.at n=42A052333
• Record primes reached in A052333.at n=11A052334
• Primes of the form 2^r * 11^s - 1.at n=17A077315
• 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=15A084924
• a(n) = 11*2^n - 1.at n=26A086225
• 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=25A087522
• 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=26A087522
• Smallest prime with exactly n consecutive ones in the longest run of ones in its binary expansion.at n=25A090593
• a(n) = n+1 if n+1 is a prime else a(n) = 2n+1 if 2n+1 is a prime else a(n) = 2*(2n+1) +1 =g(n) if this number is prime else the next candidate is 2*g(n) + 1 etc.at n=42A110359
• 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=26A118883
• Smallest prime of the form k*2^n - 1, for k >= 2.at n=25A127581
• Smallest prime of the form k*2^n - 1, for k >= 2.at n=26A127581
• a(n) = the smallest prime number of the form k*2^n - 1, for k >= 1.at n=25A127582
• a(n) = the smallest prime number of the form k*2^n - 1, for k >= 1.at n=26A127582
• a(n) = 11*4^n - 1.at n=13A198695
• Least prime p such that p+1 is divisible by 2^n and not by 2^(n+1).at n=26A201914
• Decimal representation of the middle column of the "Rule 233" elementary cellular automaton starting with a single ON (black) cell.at n=29A267880
• Prime numbersat n=38125588