The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A125739 Primes p such that 3^p + 3^((p + 1)/2) + 1 is prime. 3

%I

%S 3,5,7,17,19,79,163,317,353,1049,1759,5153,7541,23743,2237561

%N Primes p such that 3^p + 3^((p + 1)/2) + 1 is prime.

%C PrimePi[ a(n) ] = {2, 3, 4, 7, 8, 22, 38, 66, 71, 176, 274, 687, 956, ...}, the indices of the primes p.

%C a(16) > 2300000. - _Serge Batalov_, Oct 12 2014

%H J. Brillhart et al., <a href="http://dx.doi.org/10.1090/conm/022">Factorizations of b^n +- 1</a>, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.

%H S. S. Wagstaff, Jr., <a href="http://www.cerias.purdue.edu/homes/ssw/cun/index.html">The Cunningham Project</a>.

%t Do[p=Prime[n];f=3^p+3^((p+1)/2)+1;If[PrimeQ[f],Print[{n,p}]],{n,1,200}]

%o (PARI) lista(nn) = {forprime(p=3, nn, if (ispseudoprime(3^p + 3^((p + 1)/2) + 1), print1(p, ", ")););} \\ _Michel Marcus_, Oct 13 2014

%o (MAGMA) [p: p in PrimesUpTo(5000) | IsPrime(3^p+3^((p+1)div 2)+1)]; // _Vincenzo Librandi_, Oct 13 2014

%Y Cf. A125738 = Primes p such that 3^p - 3^((p + 1)/2) + 1 is prime.

%Y Cf. A007670 = Numbers n such that 2^n - 2^((n + 1)/2) + 1 is prime.

%Y Cf. A007671 = Numbers n such that 2^n + 2^((n + 1)/2) + 1 is prime.

%Y Cf. A066408 = Numbers n such that the Eisenstein integer has prime norm.

%K hard,more,nonn

%O 1,1

%A _Alexander Adamchuk_, Dec 02 2006

%E a(11)-a(13) from _Stefan Steinerberger_, Sep 08 2007

%E a(14) from Lelio R Paula (lelio(AT)sknet.com.br), May 07 2008

%E a(15) from _Serge Batalov_, Oct 12 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 25 18:47 EDT 2020. Contains 337344 sequences. (Running on oeis4.)