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.

A164597 a(n) = the largest integer such that {the n-th prime} + k(k + 1) is prime for all k where 0 <= k <= a(n).

Original entry on oeis.org

0, 1, 3, 0, 9, 0, 15, 0, 0, 1, 0, 0, 39, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 3, 0, 2, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 2, 0, 1, 0, 0, 0, 3, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1
Offset: 1

Views

Author

Leroy Quet, Aug 17 2009

Keywords

Comments

a(n) <= the n-th prime -2, for all n.

Crossrefs

Extensions

More terms from R. J. Mathar, Sep 27 2009