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.

A189802 The smallest prime(m) such that prime(m) = (prime(m+k)+prime(m-k))/2 for n values of k.

Original entry on oeis.org

5, 11, 71, 191, 571, 823, 941, 1187, 2017, 5231, 5563, 7841, 11161, 13691, 30119, 49201, 48163, 49333, 47533, 48109, 110573, 49369, 113143, 49663, 119299, 111103, 49393, 111227, 121343, 113111, 182209, 290383, 581183, 664619, 294431, 744313, 1005391, 293087
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Apr 27 2011

Keywords

Crossrefs

Cf. A178670.

Programs

  • Mathematica
    nn = 1000; p = Prime[Range[2*nn]]; t = Table[s = Take[p, n - 1] + Reverse[Take[p, {n + 1, 2 n - 1}]]; Count[s, 2*p[[n]]], {n, nn}]; n = 1; Reap[While[pos = Position[t, n, 1, 1]; pos != {}, Sow[Prime[pos[[1, 1]]]]; n++]][[2, 1]] (* T. D. Noe, Apr 2011 *)

Extensions

Corrected and extended by T. D. Noe, Apr 29 2011