|
Search: id:A002261
|
|
|
| A002261 |
|
Numbers n such that 11*2^n+1 is prime.
(Formerly M2425 N0960)
|
|
+0
3
|
|
| 1, 3, 5, 7, 19, 21, 43, 81, 125, 127, 209, 211, 3225, 4543, 10179, 15329, 18759, 28277, 93279, 105741
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
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.
|
|
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: A088732 A052333 A074106 this_sequence A079131 A106919 A005850
Adjacent sequences: A002258 A002259 A002260 this_sequence A002262 A002263 A002264
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
