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.

A072325 Number of even numbers that cannot be expressed as the difference p-q of two odd primes q < p <= prime(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 2, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 2, 0, 0, 0, 2, 2, 2, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 2, 2, 2, 1, 1, 0, 0
Offset: 2

Views

Author

T. D. Noe, Jul 15 2002, Nov 19 2006

Keywords

Comments

If a(n)=0, then Prime[n], called a cluster prime, is in A038134. If a(n)>0 then Prime[n] is in A038133.

Examples

			a(25)=1 because Prime[25]=97 and there is 1 even number, 88, that cannot be written as the difference of two odd primes less than or equal to 97.
		

Crossrefs

Programs

  • Mathematica
    m=10000; n=PrimePi[m]-1; p=Table[Prime[i+1], {i, n}]; d=Table[0, {m/2}]; c=Table[0, {n}]; For[i=2, i<=n, i++, For[j=1, j