Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #26 Dec 20 2018 14:03:03
%S 2,6,14,24,30,32,42,44,60,110,212,230,1892,1974,2210,3596,4842,6282,
%T 7184,7304,10614,20460,30830,31970,36156,65826,82926,91496,171854,
%U 227334,1370742,1834526,2048754,2071592,2075936
%N Numbers k such that 73*2^k+1 is prime.
%H Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a>
%H Ray Ballinger and Wilfrid Keller, <a href="http://www.prothsearch.com/riesel1.html">List of primes k.2^n + 1 for k < 300</a>
%H Y. Gallot, <a href="http://www.utm.edu/research/primes/programs/gallot/index.html">Proth.exe: Windows Program for Finding Large Primes</a>
%H Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</a>
%H <a href="/index/Pri#riesel">Index entries for sequences of n such that k*2^n-1 (or k*2^n+1) is prime</a>
%o (PARI) is(n)=ispseudoprime(73*2^n+1) \\ _Charles R Greathouse IV_, Jun 13 2017
%K nonn
%O 1,1
%A _James R. Buddenhagen_
%E More terms (from http://web.archive.org/web/20161028080239/http://www.prothsearch.net/riesel.html), _Joerg Arndt_, Apr 07 2013
%E a(33)-a(35) from http://www.prothsearch.com/riesel1.html by _Robert Price_, Dec 14 2018