|
%I #28 Mar 12 2020 20:53:01
%S 2,5,32,36,38,41,57,69,71,72,116,137,156,197,237,336,353,489,545,678,
%T 1040,1137,1217,1451,1577,1589,1836,3077,4640,4850,5145,7139,7766,
%U 8051,9662,11159,13433,13763,15998,16862,19002,25412,35558,47916,48509,86900
%N Numbers k such that 255*2^k+1 is prime.
%H Jeppe Stig Nielsen, <a href="/A032504/b032504.txt">Table of n, a(n) for n = 1..65</a> (terms n = 1..63 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/riesel1.html">List of primes k.2^n + 1 for k < 300</a>
%H Wilfrid Keller, <a href="http://www.prothsearch.com/riesel2.html">List of primes k.2^n - 1 for k < 300</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[255*2^# + 1] & ] (* _Robert Price_, Dec 20 2018 *)
%o (PARI) is(n)=ispseudoprime(255*2^n+1) \\ _Charles R Greathouse IV_, Jun 13 2017
%K nonn,hard
%O 1,1
%A _N. J. A. Sloane_.
%E a(46)-a(63) from the Ray Ballinger and Wilfrid Keller link by _Robert Price_, Dec 20 2018
|
