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.

A133490 Smallest number at distance 2n from nearest prime (variant 3).

Original entry on oeis.org

2, 0, 23, 53, 211, 211, 211, 1341, 1343, 2179, 3967, 15705, 16033, 19635, 24281, 24281, 31429, 31431, 31433, 38501, 38501, 58831, 203713, 206699, 206699, 370311, 370313, 370315, 370317, 1272749, 1272749, 1272749, 1357265, 1357267, 2010801
Offset: 0

Views

Author

R. J. Mathar, Nov 30 2007

Keywords

Comments

Let f(m) be the distance to the nearest prime as defined in A051700(m). Then a(n) = min { m: f(m)>= 2n}. The variants of a different definition of "distance" or demanding equality, f(m)=2n, are in A132860 and A051728.