%I #26 Sep 19 2019 03:34:33

%S 4,8,16,22,32,94,220,244,262,286,344,356,392,1996,2744,5158,6964,

%T 13484,15164,197350,300632,309560,363892,673708,1177924,1308148,

%U 1669798

%N Numbers k such that 55*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(55*2^n+1) \\ _Charles R Greathouse IV_, Jun 13 2017

%K nonn

%O 1,1

%A _James R. Buddenhagen_

%E More terms from _Hugo Pfoertner_, Jun 20 2003

%E More terms (from http://web.archive.org/web/20161028080239/http://www.prothsearch.net/riesel.html), _Joerg Arndt_, Apr 07 2013