|
%I #37 Sep 08 2022 08:44:51
%S 1,3,7,9,13,15,31,45,47,49,55,147,245,327,355,663,1423,1443,2493,3627,
%T 4737,6541,9667,22645,27321,61963,68281,144397,151741,187859,191509,
%U 273251,494607,696935,768063,831411,1040005,1357881,1765449,2099769
%N Numbers k such that 35*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>
%t Select[Range[1000], PrimeQ[35*2^#+1] &] (* _Amiram Eldar_, Dec 12 2018 *)
%o (PARI) is(n)=ispseudoprime(35*2^n+1) \\ _Charles R Greathouse IV_, Jun 12 2017
%o (Magma) [n: n in [0..5000] | IsPrime(35*2^n+1)]; // _Vincenzo Librandi_, Dec 12 2018
%K nonn,hard
%O 1,2
%A _James R. Buddenhagen_
%E More terms from _Hugo Pfoertner_, Jun 20 2003
%E Added more terms (from http://web.archive.org/web/20161028080239/http://www.prothsearch.net/riesel.html), _Joerg Arndt_, Apr 07 2013
%E a(40) from http://www.prothsearch.com/riesel1.html by _Robert Price_, Dec 12 2018
|
