Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #14 Dec 20 2024 08:52:22
%S 1,2,5,16,29,61,136,145,157,178,560,581,1001,1234,1325,1370,1405,1541,
%T 2761,2984,5441,6386,9769,10756,14144,18385,26233,27496,42422,48865,
%U 72473,115372,123262,123836,229264,359725,401653,484076,611998,762961,1319756
%N Numbers k such that 363*2^k+1 is prime.
%H Jeppe Stig Nielsen, <a href="/A323006/b323006.txt">Table of n, a(n) for n = 1..46</a> (terms n = 1..43 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>
%p select(k->isprime(363*2^k+1),[$1..1000]); # _Muniru A Asiru_, Jan 02 2019
%t Select[Range[1000], PrimeQ[363*2^# + 1] &] (* _Robert Price_, Jan 01 2019 *)
%K nonn,hard
%O 1,2
%A _Robert Price_, Jan 01 2019