109051903

Properties

Appears in sequences

• 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=13A084924
• 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=22A087522
• 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=23A087522
• 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=23A118883
• Smallest prime of the form k*2^n - 1, for k >= 2.at n=22A127581
• Smallest prime of the form k*2^n - 1, for k >= 2.at n=23A127581
• a(n) = the smallest prime number of the form k*2^n - 1, for k >= 1.at n=22A127582
• a(n) = the smallest prime number of the form k*2^n - 1, for k >= 1.at n=23A127582
• a(n) is the smallest positive integer m with exactly n ones in its binary representation and with n represented in binary as a substring of the binary representation of m.at n=24A147760
• Primes of the form 2^r * 13^s - 1.at n=15A173062
• a(n) = 13*2^n-1.at n=23A198274
• Least prime p such that p+1 is divisible by 2^n and not by 2^(n+1).at n=23A201914
• Primes p that give record exponents of 2 in p^2 - 1 (A091282).at n=16A233930
• Decimal representation of the n-th iteration of the "Rule 143" elementary cellular automaton starting with a single ON (black) cell.at n=13A267536
• Decimal representation of the middle column of the "Rule 143" elementary cellular automaton starting with a single ON (black) cell.at n=26A267539
• Prime numbersat n=6251983