|
%I #14 Jan 04 2020 17:12:34
%S 1,3,6,8,10,13,14,16,17,21,22,26,30,32,33,39,49,53,152,162,181,233,
%T 328,576,629,666,824,850,919,1131,1738,1782,1957,1983,2601,2643,2729,
%U 2784,2817,2973,3226,3478,3759,5479,6642,10889,12869,15926,16718,18022
%N Numbers k such that 375*2^k+1 is prime.
%H Jeppe Stig Nielsen, <a href="/A323028/b323028.txt">Table of n, a(n) for n = 1..83</a> (terms n = 1..81 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(375*2^k+1),[$1..1000]); # _Muniru A Asiru_, Jan 02 2019
%t Select[Range[1000], PrimeQ[375*2^# + 1] &] (* _Robert Price_, Jan 02 2019 *)
%K nonn,hard
%O 1,2
%A _Robert Price_, Jan 02 2019
|
