|
| |
|
|
A014224
|
|
Numbers n such that 3^n - 2 is prime.
|
|
29
| |
|
|
2, 4, 5, 6, 9, 22, 37, 41, 90, 102, 105, 317, 520, 541, 561, 648, 780, 786, 957, 1353, 2224, 2521, 6184, 7989, 8890, 19217, 20746, 31722, 37056, 69581, 195430
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Contribution from M. F. Hasler and F. Firoozbakht (mymontain(AT)yahoo.com), Dec 07 2009: (Start)
If n is of the form 4k+3 then 3^n-2 is composite. Because 3^n-2=
(3^4)^k*3^3-2==0 (mod 5). So there is no term of the form 4k+3.
If Q is a perfect number such gcd (3(3^a(n)-2),Q)=1 then
x=3^(a(n)-1)*(3^a(n)-2)*Q is a solution of the equation sigma(x)=3x+Q.
See comment lines of the sequences A058959 and A171271. (End)
|
|
|
REFERENCES
| Daniel Minoli, W. Nakamine, Mersenne Numbers Rooted On 3 For Number Theoretic Transforms, 1980 IEEE International Conf. on Acoust., Speech and Signal Processing. [From Daniel Minoli (daniel.minoli(AT)ses.com), Aug 26 2009]
Daniel Minoli, Voice over MPLS, McGraw-Hill, New York, NY, 2002, ISBN 0-07-140615-8 (p.114-134) [From Daniel Minoli (daniel.minoli(AT)ses.com), Aug 26 2009]
Daniel Minoli, Sufficient Forms For Generalized Perfect Numbers, Ann. Fac. Sciences, Univ. Nation. Zaire, Section Mathem; Vol. 4, No. 2, Dec 1978, pp. 277-302. [From Daniel Minoli (daniel.minoli(AT)ses.com), Aug 26 2009]
|
|
|
LINKS
| Henri & Renaud Lifchitz, PRP Records.
|
|
|
MATHEMATICA
| lst={}; Do[If[PrimeQ[3^n-2], Print[n]; AppendTo[lst, n]], {n, 10^5}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Aug 21 2008]
Do[If[Mod[n, 4]!=3 && PrimeQ[3^n-2], Print[n]], {n, 10000}] [From M. F. Hasler and F. Firoozbakht (mymontain(AT)yahoo.com), Dec 07 2009]
|
|
|
PROG
| (PARI) for(n=1, 1e4, if(ispseudoprime(3^n-2), print1(n", "))) \\ Charles R Greathouse IV, Jul 19 2011
|
|
|
CROSSREFS
| 3^n - 2 = A058481(n).
Cf. A058959, A171271. [From M. F. Hasler and F. Firoozbakht (mymontain(AT)yahoo.com), Dec 07 2009]
Sequence in context: A003306 A136585 A122721 * A175342 A077312 A140779
Adjacent sequences: A014221 A014222 A014223 * A014225 A014226 A014227
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu)
|
|
|
EXTENSIONS
| Corrected by Andrey Kulsha (Andrey_601(AT)tut.by), Feb 04 2001.
a(26)=19217, a(27)=20746 from Ryan Propper (rpropper(AT)stanford.edu), May 11 2007
a(28)=31722 from Henri Lifchitz, Oct 2002
a(29)=37056 from Henri Lifchitz, Oct 2004
a(30)=69581 from Henri Lifchitz, Jan 2005
a(31)=195430 from Theodore Burton, Feb 2007
|
| |
|
|
