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.

A276812 Prime gap residues mod previous prime gap.

Original entry on oeis.org

0, 0, 0, 2, 0, 2, 0, 2, 2, 0, 4, 2, 0, 2, 0, 2, 0, 4, 2, 0, 4, 2, 2, 4, 2, 0, 2, 0, 2, 4, 2, 2, 0, 2, 0, 0, 4, 2, 0, 2, 0, 2, 0, 2, 0, 0, 4, 2, 0, 2, 2, 0, 6, 0, 0, 2, 0, 4, 2, 0, 4, 4, 2, 0, 2, 6, 4, 2, 0, 2, 2, 6, 0, 4, 2, 2, 4, 0, 2, 2, 0, 2, 0, 4, 2, 2, 4, 2, 0, 0, 8, 4, 0, 4, 2, 0, 2, 0, 6, 4
Offset: 1

Views

Author

Andres Cicuttin, Sep 18 2016

Keywords

Examples

			For n = 4: prime(4+2) = 13, prime(4+1) = 11 and prime(4) = 7. (13-11) % (11-7) = 2 % 4 = 2, so a(4) = 2. - _Felix Fröhlich_, Oct 04 2016
		

Crossrefs

Programs

  • Mathematica
    Table[Mod[Prime[n + 2] - Prime[n + 1], Prime[n + 1] - Prime[n]], {n, 1, 100, 1}]
  • PARI
    a(n) = (prime(n+2)-prime(n+1)) % (prime(n+1)-prime(n)) \\ Felix Fröhlich, Oct 04 2016