%I #28 Dec 18 2024 19:08:58
%S 1,5,6,8,13,17,21,24,25,37,41,46,173,185,285,313,344,368,421,550,558,
%T 669,709,749,781,956,1009,1141,1165,1441,1461,1849,1961,2070,2409,
%U 2453,2658,2998,4493,5737,6281,7113,8488,8877,9198,9777,10266,11428,14200
%N Numbers k such that 393*2^k+1 is prime.
%H Jeppe Stig Nielsen, <a href="/A323041/b323041.txt">Table of n, a(n) for n = 1..76</a> (terms n = 1..71 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(393*2^k+1),[$1..1000]); # _Muniru A Asiru_, Jan 03 2019
%t Select[Range[1000], PrimeQ[393*2^# + 1] &]
%o (Magma) [n: n in [0.. 4000] | IsPrime(393*2^n+1)]; // _Vincenzo Librandi_, Jan 04 2019
%K nonn,hard
%O 1,2
%A _Robert Price_, Jan 03 2019