A032363 - OEIS

%I #30 Aug 30 2020 02:30:10

%S 2,4,7,16,19,20,22,26,40,44,46,47,50,56,59,64,92,175,215,275,407,455,

%T 1076,1090,3080,3322,6419,7639,19360,30500,38770,44164,50696,114760,

%U 117784,153847,160874,178739,379880,405514,672007,974752,1164664,1476347,2218064

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

%H Jeppe Stig Nielsen, <a href="/A032363/b032363.txt">Table of n, a(n) for n = 1..47</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 Ray Ballinger, <a href="http://www.prothsearch.com/index.html">Proth Search Page</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(27*2^n+1) \\ _Charles R Greathouse IV_, Jun 06 2017

%Y Cf. A050539 = 27*2^n-1 is prime.

%K nonn,hard

%O 1,1

%A _James R. Buddenhagen_

%E More terms from _Hugo Pfoertner_, Jun 20 2003

%E More terms from _Hugo Pfoertner_, Aug 17 2004

%E Added more terms (from http://web.archive.org/web/20161028080239/http://www.prothsearch.net/riesel.html), _Joerg Arndt_, Apr 07 2013