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.

A073124 a(n) = prime(1+prime(n)) - prime(prime(n)).

Original entry on oeis.org

2, 2, 2, 2, 6, 2, 2, 4, 6, 4, 4, 6, 2, 2, 12, 10, 4, 10, 6, 6, 6, 8, 2, 2, 12, 10, 6, 6, 2, 2, 10, 4, 14, 12, 4, 4, 10, 4, 6, 2, 6, 4, 10, 10, 12, 6, 4, 14, 6, 4, 10, 12, 8, 4, 6, 24, 10, 6, 2, 8, 14, 18, 2, 6, 2, 12, 16, 4, 6, 6, 2, 6, 26, 2, 8, 10, 4, 10, 4
Offset: 1

Views

Author

Labos Elemer, Jul 16 2002

Keywords

Comments

Number of entries in {x,..} such that pi(x) = prime(n).

Examples

			For n = 25: prime(25) = 97, pi(x) = 97 holds for 12 numbers x: {509, 510, 511, 512, 513, 514, 515, 516, 517, 518, 519, 520} so a(25) = 12. The largest 520 = A073123(25), and the smallest = A006450(25).
		

Crossrefs

Programs

  • Mathematica
    Table[Prime[Prime[n]+1]-Prime[Prime[n]], {n, 1, 256}]
    seq[max_] := Module[{p = Prime[Range[max + 1]], m = PrimePi[max], ind}, ind = Prime[Range[m]]; p[[ind + 1]] - p[[ind]]]; seq[400] (* Amiram Eldar, Feb 15 2025 *)
  • PARI
    a(n) =  prime(1+prime(n)) - prime(prime(n)); \\ Michel Marcus, Dec 11 2013

Formula

a(n) = Card{x; A000720(x) = A000040(n)}.
a(n) = A072677(n) - A006450(n).

Extensions

More terms from Michel Marcus, Dec 11 2013