|
%I #25 Sep 19 2019 03:35:45
%S 1,4,5,9,10,14,17,18,21,25,37,38,44,60,65,94,133,153,228,280,314,326,
%T 334,340,410,429,626,693,741,768,1150,1290,1441,2424,2478,3024,3293,
%U 4956,5221,6416,8480,20746,24633,30053,34074,88366,121917,125218,130221,131325,141497,151269,222861,263413,270094,425028,448833,521925,775857,892164,898308,1070449,1356980,1530888,1625970,1686050,1784498
%N Numbers k such that 63*2^k+1 is prime.
%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 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 <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>
%o (PARI) is(n)=ispseudoprime(63*2^n+1) \\ _Charles R Greathouse IV_, Jun 13 2017
%K nonn
%O 1,2
%A _James R. Buddenhagen_
%E More terms (from http://web.archive.org/web/20161028080239/http://www.prothsearch.net/riesel.html), _Joerg Arndt_, Apr 07 2013
|
