%I A002274 M0822 N0313
%S A002274 2,3,7,8,10,16,18,19,40,48,55,90,96,98,190,398,456,502,719,1312,1399,
%T A002274 1828,6723,6816,10680,12592,20742,25010,26838,29623,45435,52783,70950,
%U A002274 89691,111691,114400,136152,145183,146223
%N A002274 Numbers n such that 57*2^n+1 is prime.
%D A002274 H. Riesel, ``Prime numbers and computer methods for factorization,'' 
               Progress in Mathematics, Vol. 57, Birkhauser, Boston, 1985, Chap. 
               4, see pp. 381-384.
%D A002274 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.
%D A002274 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 
               (includes this sequence).
%D A002274 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, 
               Academic Press, 1995 (includes this sequence).
%H A002274 Ray Ballinger and Wilfrid Keller, <a href="http://www.prothsearch.net/
               riesel.html">List of primes k.2^n + 1 for k < 300</a>
%H A002274 Ray Ballinger, <a href="http://www.prothsearch.net/index.html">Proth 
               Search Page</a>
%H A002274 Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/
               index.html">Proth.exe: Windows Program for Finding Large Primes</
               a>
%H A002274 Wilfrid Keller, <a href="http://www.prothsearch.net/riesel2.html">List 
               of primes k.2^n - 1 for k < 300</a>
%H A002274 <a href="Sindx_Pri.html#riesel">Index entries for sequences of n such 
               that k*2^n-1 (or k*2^n+1) is prime</a>
%Y A002274 Sequence in context: A028808 A029718 A051468 this_sequence A102664 A055053 
               A047221
%Y A002274 Adjacent sequences: A002271 A002272 A002273 this_sequence A002275 A002276 
               A002277
%K A002274 hard,nonn
%O A002274 1,1
%A A002274 N. J. A. Sloane (njas(AT)research.att.com).
%E A002274 More terms from Hugo Pfoertner (hugo(AT)pfoertner.org), Jun 20 2003