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”).

A187714
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
7148695169714208807, 17968583418362170239, 26363076126393718191, 57376760867272385247, 67950587841687767283, 73873959473901564111, 81055172741266754727, 96217896533288105991, 104173338506128098489
OFFSET
1,1
COMMENTS
Wilfrid Keller (2004, published) gave the first known example.
7148695169714208807 computed in 2017 by the author.
Conjecture: 7148695169714208807 is the smallest Riesel number that is divisible by 3. - Arkadiusz Wesolowski, May 12 2017
LINKS
Chris Caldwell, The Prime Glossary, Riesel number
Carlos Rivera, Problem 49
CROSSREFS
Sequence in context: A219283 A306797 A213529 * A222534 A071759 A364363
KEYWORD
nonn
AUTHOR
EXTENSIONS
Name changed and entry revised by Arkadiusz Wesolowski, May 11 2017
STATUS
approved