|
%I #13 Jan 04 2020 16:34:20
%S 1,10,16,18,21,33,37,48,57,66,96,108,133,198,262,480,550,673,858,988,
%T 1065,1576,1737,1756,1920,2362,2860,2917,4666,5988,6598,11206,14326,
%U 28317,37158,53617,53896,63925,80022,125992,186325,211897,318880,428428,443212
%N Numbers k such that 453*2^k+1 is prime.
%H Jeppe Stig Nielsen, <a href="/A323196/b323196.txt">Table of n, a(n) for n = 1..51</a> (terms n = 1..49 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>
%t Select[Range[1000], PrimeQ[453*2^# + 1] &]
%K nonn,hard
%O 1,2
%A _Robert Price_, Jan 06 2019
|
