|
Search: id:A002237
|
|
|
| A002237 |
|
Numbers n such that 15*2^n-1 is prime.
(Formerly M0976 N0365)
|
|
+0
1
|
|
| 1, 2, 4, 5, 10, 14, 17, 31, 41, 73, 80, 82, 116, 125, 145, 157, 172, 202, 224, 266, 289, 293, 463, 1004, 1246, 2066, 2431, 2705, 4622, 5270, 7613, 21727, 21962, 40742, 41054, 60622, 83263, 83669, 91457, 103940, 104177, 108124, 115327, 161453, 172714, 454681, 568780, 656264, 712294, 902474, 1084010, 1344313
(list; graph; listen)
|
|
|
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.
|
|
LINKS
|
Ray Ballinger and Wilfrid Keller, List of primes k.2^n + 1 for k < 300
Wilfrid Keller, List of primes k.2^n - 1 for k < 300
Index entries for sequences of n such that k*2^n-1 (or k*2^n+1) is prime
Discussion group for the primality-testing program, PrimeForm.
Kosmaj, Riesel list k<300.
|
|
CROSSREFS
|
Cf. A002258: 15*2^n+1 is prime.
Adjacent sequences: A002234 A002235 A002236 this_sequence A002238 A002239 A002240
Sequence in context: A018360 A133585 A008283 this_sequence A067935 A097133 A023165
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
njas, Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
EXTENSIONS
|
More terms from Hugo Pfoertner (hugo(AT)pfoertner.org), Jun 29 2004
More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), Jan 02 2008
|
|
|
Search completed in 0.002 seconds
|
