Currently there may be errors shown on top of a page, because of a missing Wiki update (PHP version and extension DPL3).
Navigation
Topics Help • Register • News • History • How to • Sequences statistics • Template prototypes

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

From Prime-Wiki
Revision as of 07:34, 26 July 2021 by Karbon (talk | contribs) (new)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

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

See also

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