|
| |
|
|
A002236
|
|
Numbers n such that 9*2^n - 1 is prime.
(Formerly M2634 N1045)
|
|
1
| |
|
|
1, 3, 7, 13, 15, 21, 43, 63, 99, 109, 159, 211, 309, 343, 415, 469, 781, 871, 939, 1551, 3115, 3349, 5589, 5815, 5893, 7939, 8007, 11547, 12495, 22555, 23647, 35647, 83415, 103059, 184999, 275859, 384243, 484975, 503893, 828709, 1010277
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
REFERENCES
| H. Riesel, Lucasian criteria for the primality of N=h.2^n-1, Math. Comp., 23 (1969), 869-875.
H. Riesel, ``Prime numbers and computer methods for factorization,'' Progress in Mathematics, Vol. 57, Birkhauser, Boston, 1985, Chap. 4, see pp. 381-384.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
|
LINKS
| Wilfrid Keller, List of primes k.2^n - 1 for k < 300
C. K. Caldwell, The Prime Pages
Index entries for sequences of n such that k*2^n-1 (or k*2^n+1) is prime
Kosmaj, Riesel list k<300.
|
|
|
CROSSREFS
| Cf. A050524.
Sequence in context: A056530 A092734 A192854 * A080565 A164344 A002254
Adjacent sequences: A002233 A002234 A002235 * A002237 A002238 A002239
|
|
|
KEYWORD
| hard,nonn,nice
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
EXTENSIONS
| More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008
|
| |
|
|