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.

A109831 Greatest number of primes < prime(n) forming an arithmetic progression such that also prime(n) is a term.

Original entry on oeis.org

1, 1, 2, 2, 1, 2, 2, 3, 4, 2, 1, 3, 3, 2, 4, 3, 2, 2, 2, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 4, 4, 2, 3, 3, 3, 5, 3, 3, 4, 2, 3, 3, 3, 4, 3, 2, 3, 4, 3, 3, 3, 3, 4, 5, 3, 3, 4, 2, 3, 4, 4, 3, 5, 3, 3, 3, 2, 3, 3, 5, 3, 3, 4, 2, 3, 4, 4, 3, 3, 3, 4, 3, 3, 3, 4, 4, 3, 3, 5, 3, 4, 3, 3, 2, 3, 5, 4, 3, 3, 3, 2, 3
Offset: 2

Views

Author

Reinhard Zumkeller, Jul 04 2005

Keywords

Comments

a(n) = (A000040(n) - A109833(n)) / A109832(n).