|
%I #9 May 30 2020 14:35:23
%S 1,5,9,13,25,85,113,133,185,217,269,285,469,1025,2289,4849,5681,8489,
%T 12937,18485,18809,20189,34361,40509,41593,44181,46517,68681,130421,
%U 186893,187937,255137,457801,469901,970353,1387625,2043829
%N Numbers k such that 413*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/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(413*2^k+1),[$1..1000]); # _Muniru A Asiru_, Jan 04 2019
%t Select[Range[1000], PrimeQ[413*2^# + 1] &]
%K nonn,more,hard
%O 1,2
%A _Robert Price_, Jan 04 2019
%E a(37) from _Jeppe Stig Nielsen_, May 30 2020
|
