Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #22 Dec 18 2024 15:06:28
%S 2,6,9,21,41,50,74,105,119,161,191,246,255,402,419,540,941,1085,1245,
%T 1250,1415,1992,2169,2243,2640,4908,5102,6410,9078,13215,15609,16239,
%U 19059,25070,27326,30455,30681,44255,64833,81269,112710,119001,187589,201468
%N Numbers k such that 465*2^k+1 is prime.
%H Jeppe Stig Nielsen, <a href="/A318193/b318193.txt">Table of n, a(n) for n = 1..63</a> (terms n = 1..58 from Robert Price)
%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/riesel1a.html">List of primes k.2^n + 1 for 300 < k < 600</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 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/ProthPrime.html">Proth Prime</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>.
%t Select[Range[1000], PrimeQ[465*2^# + 1] &]
%K nonn,hard
%O 1,1
%A _Robert Price_, Jan 07 2019