|
%I #15 Jan 04 2020 08:10:52
%S 2,4,7,8,11,12,15,16,19,24,28,51,59,62,63,64,75,79,132,338,355,518,
%T 692,806,1287,1618,1803,2715,2743,2834,3055,3255,3323,4067,5255,6094,
%U 6254,6796,7063,7476,7787,8067,10795,13342,14407,22292,23132,27076,30286
%N Numbers k such that 417*2^k+1 is prime.
%H Jeppe Stig Nielsen, <a href="/A323108/b323108.txt">Table of n, a(n) for n = 1..73</a> (terms n = 1..70 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(417*2^k+1),[$1..1000]); # _Muniru A Asiru_, Jan 04 2019
%t Select[Range[1000], PrimeQ[417*2^# + 1] &]
%K nonn,hard
%O 1,1
%A _Robert Price_, Jan 04 2019
|
