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.

A139296 a(n) = 2^(2p - 1)/2, where p is the n-th Mersenne prime A000668(n).

Original entry on oeis.org

16, 4096, 1152921504606846976, 7237005577332262213973186563042994240829374041602535252466099000494570602496
Offset: 1

Views

Author

Omar E. Pol, Apr 13 2008

Keywords

Comments

a(5) has 4931 digits and is too large to include. - R. J. Mathar, May 30 2008

Crossrefs

Programs

  • Mathematica
    a[n_] := 2^(2^(MersennePrimeExponent[n] + 1) - 4); Array[a, 4] (* Amiram Eldar, Jul 10 2025 *)

Formula

a(n) = 2^(2*A000668(n)-1)/2.

Extensions

One more term from R. J. Mathar, May 30 2008