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.

A152099 a(n) = (2^prime(n) - 1)*(2^prime(n) + 1) = 2^(2*prime(n)) - 1.

Original entry on oeis.org

15, 63, 1023, 16383, 4194303, 67108863, 17179869183, 274877906943, 70368744177663, 288230376151711743, 4611686018427387903, 18889465931478580854783, 4835703278458516698824703, 77371252455336267181195263, 19807040628566084398385987583
Offset: 1

Views

Author

Roger L. Bagula, Nov 24 2008

Keywords

Comments

Idea resulted from seqfan posts by Artur Jasinski.

Crossrefs

Programs

  • Mathematica
    Table[(2^Prime[n] - 1)*(2^Prime[n] + 1), {n, 1, 20}]
  • Python
    from sympy import prime
    def A152099(n): return (1<<(prime(n)<<1))-1 # Chai Wah Wu, Jun 26 2023

Formula

a(n) = A001348(n) * A098640(n).
a(n) = A034785(n)^2 - 1.
a(n) = A000302(A000040(n)) - 1.