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.

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

Original entry on oeis.org

0, 255, 72057594037927935, 452312848583266388373324160190187140051835877600158453279131187530910662655
Offset: 1

Views

Author

Omar E. Pol, Apr 13 2008

Keywords

Comments

Next term is too large to list here.

Crossrefs

Programs

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

Formula

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

Extensions

Edited by Max Alekseyev, Apr 23 2010