A132661 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A132661

Mersenne prime M(n) raised to power M(n).

1

27, 823543, 17069174130723235958610643029059314756044734431

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

A Mersenne prime is a prime of the form 2^p - 1 where p is a prime.

LINKS

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

Chris K. Caldwell, Mersenne Primes.

Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.

FORMULA

a(n) = A000312(A000668(n)). - Amiram Eldar, Oct 17 2024

EXAMPLE

a(2) = 823543 because M(2) = 7 and we can write 823543 = 7^7 or 823543 = 7*7*7*7*7*7*7.

MATHEMATICA

Map[(2^#-1)^(2^#-1) &, MersennePrimeExponent[Range[3]]] (* Amiram Eldar, Oct 17 2024 *)

CROSSREFS

Cf. A000043, A000312, A000668, A086166.

Sequence in context: A377768 A132649 A086166 * A050650 A106536 A227115

Adjacent sequences: A132658 A132659 A132660 * A132662 A132663 A132664

KEYWORD

nonn

AUTHOR

Omar E. Pol, Aug 25 2007

STATUS

approved