|
Search: id:A002274
|
|
|
| A002274 |
|
Numbers n such that 57*2^n+1 is prime.
(Formerly M0822 N0313)
|
|
+0
1
|
|
| 2, 3, 7, 8, 10, 16, 18, 19, 40, 48, 55, 90, 96, 98, 190, 398, 456, 502, 719, 1312, 1399, 1828, 6723, 6816, 10680, 12592, 20742, 25010, 26838, 29623, 45435, 52783, 70950, 89691, 111691, 114400, 136152, 145183, 146223
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
REFERENCES
|
H. Riesel, ``Prime numbers and computer methods for factorization,'' Progress in Mathematics, Vol. 57, Birkhauser, Boston, 1985, Chap. 4, see pp. 381-384.
R. M. Robinson, A report on primes of the form k.2^n+1 and on factors of Fermat numbers, Proc. Amer. Math. Soc., 9 (1958), 673-681.
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
|
Ray Ballinger and Wilfrid Keller, List of primes k.2^n + 1 for k < 300
Ray Ballinger, Proth Search Page
Y. Gallot, Proth.exe: Windows Program for Finding Large Primes
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
|
|
CROSSREFS
|
Sequence in context: A028808 A029718 A051468 this_sequence A102664 A055053 A047221
Adjacent sequences: A002271 A002272 A002273 this_sequence A002275 A002276 A002277
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
More terms from Hugo Pfoertner (hugo(AT)pfoertner.org), Jun 20 2003
|
|
|
Search completed in 0.002 seconds
|
