A323146 - OEIS

%I #15 Jan 04 2020 15:05:35

%S 2,4,5,7,11,18,19,33,51,68,69,82,93,99,101,113,132,138,141,198,201,

%T 255,298,522,528,533,537,547,790,903,1032,1195,1365,1612,1725,2223,

%U 2343,2398,3740,4138,4315,6285,7161,10401,13444,19922,23030,26104,26922,28617

%N Numbers k such that 435*2^k+1 is prime.

%H Jeppe Stig Nielsen, <a href="/A323146/b323146.txt">Table of n, a(n) for n = 1..91</a> (terms n = 1..86 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(435*2^k+1),[$1..1000]); # _Muniru A Asiru_, Jan 05 2019

%t Select[Range[1000], PrimeQ[435*2^# + 1] &]

%K nonn,hard

%O 1,1

%A _Robert Price_, Jan 05 2019