login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A189802 The smallest prime(m) such that prime(m) = (prime(m+k)+prime(m-k))/2 for n values of k. 0
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
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 *)
CROSSREFS
Cf. A178670.
Sequence in context: A216071 A050568 A065555 * A328453 A175207 A067890
KEYWORD
nonn
AUTHOR
EXTENSIONS
Corrected and extended by T. D. Noe, Apr 29 2011
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 19 10:10 EDT 2024. Contains 374392 sequences. (Running on oeis4.)