265483

Properties

Appears in sequences

• a(1) = 2; a(n+1) is obtained by writing a(n) in binary and trying to complement just one bit, starting with the least significant bit, until a new prime is reached.at n=42A059459
• Primes p such that p-1 divides 2^p-2.at n=35A069051
• Evaluate n^4 - 93n^3 + 3196n^2 - 48008n + 265483 for n >= 0, record the primes.at n=0A095974
• Odd integers k such that 5^((k-1)/2) + 1 == 0 (mod k*(k-1)/2).at n=23A337829
• Prime numbersat n=23269