Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #32 Dec 20 2018 10:32:24
%S 2,14,914,12614,335522,1567874
%N Numbers k such that 139*2^k + 1 is prime.
%H Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</a>
%H Ray Ballinger & 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>
%p select(k->isprime(139*2^k+1),[$0..1000])[]; # _Muniru A Asiru_, Dec 18 2018
%t Select[Range[1000], PrimeQ[139*2^# + 1] & ] (* _Robert Price_, Dec 18 2018 *)
%o (PARI) is(n)=ispseudoprime(139*2^n+1) \\ _Charles R Greathouse IV_, Jun 07 2017
%Y Cf. A032418, A032373, A032420, A032460, A032497.
%K nonn,hard,more
%O 1,1
%A _James R. Buddenhagen_
%E One more term (from the Ballinger-Keller web page) from _M. F. Hasler_, Apr 18 2007
%E a(6) from the Ray Ballinger and Wilfrid Keller link by _Robert Price_, Dec 18 2018