Sierpiński numbers of the form k•2n+1

Sierpiński numbers are odd numbers k for which k•2ⁿ+1 is composite for all natural numbers n.

See also

• OEIS sequence A076336: 15,000 Sierpiński numbers

Table

There are 11 sequences in this Wiki:

k	Covering set
78557	[3, 5, 7, 13, 19, 37, 73]
271129	[3, 5, 7, 13, 17, 241]
271577	[3, 5, 7, 13, 17, 241]
322523	[3, 5, 7, 13, 37, 73, 109]
327739	[3, 5, 7, 13, 17, 97, 257]
482719	[3, 5, 7, 13, 17, 241]
575041	[3, 5, 7, 13, 17, 241]
603713	[3, 5, 7, 13, 17, 241]
903983	[3, 5, 7, 13, 17, 241]
934909	[3, 5, 7, 13, 19, 73, 109]
965431	[3, 5, 7, 13, 17, 241]

Proth primes

Miscellaneous

Proth prime Sierpiński problem Least n (k≤12)

Tables

1-300 300-2000 2000-4000 4000-6000 6000-8000 8000-10000 104-105 105-106 106-107 107-108 108-109 109-1010 1010-∞

Categories

1-300 300-2000 2000-4000 4000-6000 6000-8000 8000-10000 104-105 105-106 106-107 107-108 108-109 109-1010 1010-∞

Others

3k 15k 2145k 2805k 0 primes 100+ primes Sierpiński numbers Missing ranges

Other categories

Sierpiński numbers Missing ranges Low weight Count 0

Other bases

3 4 5 6 7 11 999