|
Search: id:A076335
|
|
|
| A076335 |
|
Brier numbers: both Riesel and Sierpinski, or n such that for all k >= 1 the numbers n*2^k + 1 and n*2^k - 1 are composite. |
|
+0
3
|
|
| 878503122374924101526292469, 3872639446526560168555701047, 623506356601958507977841221247
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
These are just the smallest examples known - there may be smaller ones.
There are no Brier numbers below 10^9. [From Arkadiusz Wesolowski (math(AT)wesolowski.ids.pl), Aug 03 2009]
|
|
LINKS
|
Chris Caldwell, Riesel Numbers
Chris Caldwell, Sierpinski Numbers
Yves Gallot, A search for some small Brier numbers, 2000.
Joe McLean, Brier Numbers
C. Rivera, Brier numbers
Eric Weisstein's World of Mathematics, Brier Number
|
|
CROSSREFS
|
Cf. A076336, A076337, A052333, A003261.
Sequence in context: A133849 A095446 A053776 this_sequence A146561 A095448 A105298
Adjacent sequences: A076332 A076333 A076334 this_sequence A076336 A076337 A076338
|
|
KEYWORD
|
nonn,bref
|
|
AUTHOR
|
Olivier Gerard (olivier.gerard(AT)gmail.com), Nov 07 2002
|
|
|
Search completed in 0.005 seconds
|
