OFFSET
1,1
COMMENTS
Closely related to the prime number theorem; a(n) has the asymptotic expression n * log(n) / 2.
LINKS
Harry J. Smith, Table of n, a(n) for n = 1..1000
Romeo Meštrović, Curious conjectures on the distribution of primes among the sums of the first 2n primes, arXiv:1804.04198 [math.NT], 2018.
FORMULA
a(n) = floor(A007504(n) / n).
EXAMPLE
a(5) = floor((2 + 3 + 5 + 7 + 11)/5) = 5.
MATHEMATICA
With[{prms=Prime[Range[500]]}, Table[Floor[Mean[Take[prms, n]]], {n, 70}]] (* Harvey P. Dale, Mar 09 2011 *)
PROG
(PARI) { n=0; s=0; forprime (p=2, prime(1000), s+=p; write("b060620.txt", n++, " ", floor(s/n)); ) } \\ Harry J. Smith, Jul 08 2009
(PARI) a(n) = sum(k=1, n, prime(k))\n; \\ Michel Marcus, Jul 03 2018
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 25 2001
EXTENSIONS
More terms from Larry Reeves (larryr(AT)acm.org), Jun 11 2001
STATUS
approved