login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A187716
Odd numbers m divisible by 3 such that for every k >= 1, m*2^k + 1 has a divisor in the set {5, 7, 11, 13, 17, 19, 31, 37, 41, 61, 73, 109, 151, 241, 331}.
4
21484572547591559649, 50166404682516122859, 51814002736113272553, 53246606581410442023, 58992081042572747991, 65634687179877002283, 80269357428943941837, 92027572854849003627, 103083799330841020677
OFFSET
1,1
COMMENTS
Wilfrid Keller (2004, published) gave the first known example.
21484572547591559649 computed in 2017 by the author.
Conjecture: 21484572547591559649 is the smallest Sierpiński number that is divisible by 3. - Arkadiusz Wesolowski, May 12 2017
The above conjecture is false, because the Sierpiński number 7592506760633776533 is a counterexample. - Arkadiusz Wesolowski, Jul 27 2023
LINKS
Chris Caldwell, The Prime Glossary, Sierpinski number
Carlos Rivera, Problem 49. Sierpinski-like numbers, The Prime Puzzles & Problems Connection.
CROSSREFS
Sequence in context: A175273 A105303 A116356 * A169667 A132902 A288290
KEYWORD
nonn
AUTHOR
EXTENSIONS
Name changed and entry revised by Arkadiusz Wesolowski, May 11 2017
STATUS
approved