OFFSET
1,1
COMMENTS
The old definition was: Primes p>=5 with the property: if Prime(k)<p/2<Prime(k+1), then p<=Prime(k)+ Prime(k+1)
If A(x) is the counting function of a(n) not exceeding x, then, in view of the symmetry, it is natural to conjecture that A(x)~pi(x)/2.
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
EXAMPLE
Taking p=2, q=3, k=3 we get r=2+3=5, the first term.
Taking p=3, q=5, k=4 we get r=3+4=7, the second term.
From p=89, q=97 we can take both k=90 and k=92, getting the terms 89+90=179 and 89+92=181. - Art Baker, Mar 16 2019
MATHEMATICA
Reap[Do[p=Prime[n]; k=PrimePi[p/2]; If[p<=Prime[k]+Prime[k+1], Sow[p]], {n, 3, PrimePi[1000]}]][[2, 1]]
Select[#[[1]]+Range[#[[1]]+1, #[[2]]], PrimeQ]&/@Partition[Prime[Range[60]], 2, 1]//Flatten (* Harvey P. Dale, Jul 02 2024 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Oct 17 2009
EXTENSIONS
Extended by T. D. Noe, Dec 01 2010
Edited with simpler definition based on a suggestion from Art Baker. -N. J. A. Sloane, Mar 16 2019
STATUS
approved
