|
%I #17 Sep 08 2022 08:46:23
%S 4,8,10,22,40,52,56,58,136,152,154,208,316,356,364,472,752,1006,1244,
%T 2324,2684,3980,5468,8552,10236,14240,15460,20984,21862,24682,26900,
%U 35588,39344,45984,64762,73786,142612,189464,230204,292018,449804,1138720,1328250
%N Numbers k such that 445*2^k+1 is prime.
%C The associated primes are: 7121, 113921, 455681, 1866465281, 489282674360321, 2004101834179870721, 32065629346877931521, 128262517387511726081, 38764967239633309757747635278627034649067521, 2540500893016608588283749025620101342761288990721, 10162003572066434353134996102480405371045155962881. - _Vincenzo Librandi_, Jan 06 2019
%H Robert Price, <a href="/A323151/b323151.txt">Table of n, a(n) for n = 1..46</a>
%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(445*2^k+1),[$1..1000]); # _Muniru A Asiru_, Jan 05 2019
%t Select[Range[1000], PrimeQ[445*2^# + 1] &]
%o (Magma) [n: n in [1..5000] | IsPrime(445*2^n+1)]; // _Vincenzo Librandi_, Jan 06 2019
%K nonn,hard
%O 1,1
%A _Robert Price_, Jan 05 2019
|
