|
Search: id:A002258
|
|
|
| A002258 |
|
Numbers n such that 15*2^n+1 is prime.
(Formerly M1165 N0445)
|
|
+0
2
|
|
| 1, 2, 4, 9, 10, 12, 27, 37, 38, 44, 48, 78, 112, 168, 229, 297, 339, 517, 522, 654, 900, 1518, 2808, 2875, 3128, 3888, 4410, 6804, 7050, 7392, 19219, 21445, 21550, 24105, 24995, 34224, 34260, 43388, 48444, 61758, 184290
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
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.
|
|
LINKS
|
Ray Ballinger, Proth Search Page
Ray Ballinger and Wilfrid Keller, List of primes k.2^n + 1 for k < 300
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: A076661 A072583 A047465 this_sequence A026602 A103078 A060756
Adjacent sequences: A002255 A002256 A002257 this_sequence A002259 A002260 A002261
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
