2931991

Appears in sequences

• (Provable) Sierpiński numbers: odd numbers n such that for all k >= 1 the numbers n*2^k + 1 are composite.at n=24A076336
• Smallest Sierpinski number that is divisible by the n-th prime.at n=10A222534
• Smallest Sierpinski number that is divisible by the n-th prime.at n=27A222534
• Odd integers m such that for every integer k > 0, m*2^k+1 has a divisor in the set {3, 5, 7, 13, 17, 241}.at n=14A244561
• Odd numbers n not congruent to 5 mod 6 such that for all k >= 1 the numbers n*4^k + 1 are composite.at n=23A251057