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.

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

Original entry on oeis.org

1, 511, 144115188075855871, 904625697166532776746648320380374280103671755200316906558262375061821325311
Offset: 1

Views

Author

Omar E. Pol, Apr 13 2008

Keywords

Crossrefs

Programs

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

Formula

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

Extensions

a(4) from Amiram Eldar, Jul 10 2025