login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077586 a(n) = 2^(2^prime(n) - 1) - 1. 5
7, 127, 2147483647, 170141183460469231731687303715884105727 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

First four terms are primes. Fifth (1.61585...*10^616), sixth (5.45374...*10^2465), seventh (2.007...*10^39456) and eighth (1.298...*10^157826) are not primes.

Note that a(n) divides 2^a(n)-2 for every n, so if a(n) is composite then a(n) is a Fermat pseudoprime to base 2; cf. A007013. - Thomas Ordowski, Apr 08 2016

LINKS

Table of n, a(n) for n=1..4.

Eric Weisstein's World of Mathematics, Double Mersenne Number

FORMULA

a(n) = A077585(A000040(n)) = A000225(A001348(n)).

EXAMPLE

a(3) = 2^(2^5 - 1) - 1 = 2^31 - 1 = 2147483647.

MATHEMATICA

lst={}; Do[p=Prime[n]; If[PrimeQ[x=2^(2^p-1)-1], Print[x]; AppendTo[lst, n]], {n, 10^9}]; lst (* Vladimir Joseph Stephan Orlovsky, Aug 21 2008 *)

CROSSREFS

Sequence in context: A134722 A053713 * A277634 A263686 A002614 A187237

Adjacent sequences:  A077583 A077584 A077585 * A077587 A077588 A077589

KEYWORD

nonn

AUTHOR

Henry Bottomley, Nov 07 2002

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy .

Last modified December 8 16:27 EST 2016. Contains 278946 sequences.