|
%I #28 Jan 04 2020 08:13:28
%S 8,10,14,16,36,62,76,88,114,138,258,278,338,416,538,590,736,1074,1154,
%T 1262,1768,2602,2820,3436,3702,3970,4778,5990,7598,8088,9398,9628,
%U 13036,14954,15112,16334,16636,17958,22994,23054,25130,30660,35358,64560,78770
%N Numbers k such that 385*2^k+1 is prime.
%H Jeppe Stig Nielsen, <a href="/A322998/b322998.txt">Table of n, a(n) for n = 1..62</a> (terms n = 1..60 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(385*2^k+1),[$1..1000]); # _Muniru A Asiru_, Jan 03 2019
%t Select[Range[1000], PrimeQ[385*2^# + 1] &]
%K nonn,hard
%O 1,1
%A _Robert Price_, Jan 03 2019
|
