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.

A176246 a(n) = A001223(n+1) - 1.

Original entry on oeis.org

1, 1, 3, 1, 3, 1, 3, 5, 1, 5, 3, 1, 3, 5, 5, 1, 5, 3, 1, 5, 3, 5, 7, 3, 1, 3, 1, 3, 13, 3, 5, 1, 9, 1, 5, 5, 3, 5, 5, 1, 9, 1, 3, 1, 11, 11, 3, 1, 3, 5, 1, 9, 5, 5, 5, 1, 5, 3, 1, 9, 13, 3, 1, 3, 13, 5, 9, 1, 3, 5, 7, 5, 5, 3, 5, 7, 3, 7, 9, 1, 9, 1, 5, 3, 5, 7, 3, 1, 3, 11, 7, 3, 7
Offset: 1

Views

Author

Edmund Algeo, Apr 13 2010

Keywords

Comments

Previous name was: Numbers which added to an odd prime plus one, yield the next prime in the series for primes.
Essentially a duplicate of A046933 and A135732. - T. D. Noe, Oct 23 2013

Crossrefs

Cf. A046933 (number of composites between successive primes).

Programs

  • Mathematica
    Differences[Prime[Range[2, 100]]] - 1 (* Paolo Xausa, Jul 02 2025 *)

Formula

a(n) = A001223(n+1) - 1. - Michel Marcus, Jun 08 2013

Extensions

New name using formula from Michel Marcus, Joerg Arndt, Oct 22 2013