cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A134753 Numbers k such that 3^(2*k-1) + 2 is prime.

This page as a plain text file.
%I A134753 #27 Aug 14 2025 00:56:42
%S A134753 1,2,8,32,62,70,118,122,158,182,196,566,752,3602,21896,22768,53072
%N A134753 Numbers k such that 3^(2*k-1) + 2 is prime.
%C A134753 From _Enrique Pérez Herrero_, Jul 29 2010: (Start)
%C A134753 With: f(n)=3^(2n-1)+2, the non-primality of f(n) is settled when:
%C A134753 if 2 does not divide n, 5 divides f(n) (n>1)
%C A134753 if 3 divides n, 7 divides f(n)
%C A134753 if 5 divides n-4, 11 divides f(n)
%C A134753 if 14 divides n-2, 29 divides f(n)
%C A134753 if 15 divides n-5, 31 divides f(n). (End)
%D A134753 _Luis H. Gallardo_, Posting to the Number Theory List, Jan 14 2008
%H A134753 L. H. Gallardo, <a href="http://dx.doi.org/10.4171/EM/149">On a remark of Makowski about perfect numbers</a>, El. Mathem. 65 (3) (2010) 121-126
%H A134753 Henri & Renaud Lifchitz, <a href="http://www.primenumbers.net/prptop/searchform.php?form=3%5En%2B2&amp;action=Search">PRP Records</a>.
%F A134753 ({odd terms in A051783} + 1)/2.
%t A134753 MaxVal = 1000;
%t A134753 dataA134753=Select[Select[Range[MaxVal],#<3||Mod[#,2]==0&&Mod[#,3]!=0&&Mod[#,5]!=4&&Mod[#,14]!=2&&Mod[#,15]!=5&],PrimeQ[3^(2*#-1)+2]&]
%t A134753 A134753[n_Integer] := dataA134753[[n]] /; (n > 0 && n <= Length[dataA134753]) (* _Enrique Pérez Herrero_, Jul 29 2010 *)
%o A134753 (PARI) is(n)=isprime(3^(2*n-1)+2) \\ _Charles R Greathouse IV_, Jun 06 2017
%Y A134753 Cf. A051783, A134752.
%K A134753 nonn,more,hard
%O A134753 1,2
%A A134753 _N. J. A. Sloane_, Jan 28 2008
%E A134753 Typo in prime search corrected _Enrique Pérez Herrero_, Jul 31 2010
%E A134753 a(15)-a(17) from A051783 by _Ray Chandler_, Aug 06 2011