
OFFSET

1,1


COMMENTS

509203 has been proved to be a member of the sequence, and is conjectured to be the smallest member. However, as of 2009, there are still several smaller numbers which are candidates and have not yet been ruled out (see links).
Riesel numbers are proved by exhibiting a periodic sequence p of prime divisors with p(k)  n*2^k1 and disproved by finding prime n*2^k1. It is conjectured that numbers that cannot be proved Riesel in this way are nonRiesel. However, some numbers resist both proof and disproof.


REFERENCES

Dan Ismailescu and Peter Seho Park, On Pairwise Intersections of the Fibonacci, Sierpinski, and Riesel Sequences, Journal of Integer Sequences, 16 (2013), #13.9.8.
P. Ribenboim, The Book of Prime Number Records, 2nd. ed., 1989, p. 282.


LINKS

Table of n, a(n) for n=1..1.
R. Ballinger and W. Keller, The Riesel Problem: Definition and Status
Chris Caldwell, Riesel Numbers
Chris Caldwell, Sierpinski Numbers
Yves Gallot, A search for some small Brier numbers, 2000.
Tanya Khovanova, Non Recursions
Joe McLean, Brier Numbers
C. Rivera, Brier numbers
Eric Weisstein's World of Mathematics, Riesel numbers


CROSSREFS

Cf. A076336, A076335, A003261, A052333, A101036.
Sequence in context: A195525 A124945 A205167 * A101036 A244070 A206430
Adjacent sequences: A076334 A076335 A076336 * A076338 A076339 A076340


KEYWORD

nonn,bref,hard,more


AUTHOR

N. J. A. Sloane, Nov 07 2002


EXTENSIONS

Normally I require at least four terms but I am making an exception for this one in view of its importance.  N. J. A. Sloane, Nov 07, 2002. See A101036 for the most likely extension.
Edited by N. J. A. Sloane, Nov 13 2009


STATUS

approved

