login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A112039
Let b(0)=1/2, b(n) = b(n-1) + Prime[n]/2; a(n)=b(2*n).
1
3, 9, 21, 39, 65, 99, 141, 191, 251, 320, 396, 482, 581, 686, 797, 926, 1064, 1214, 1374, 1544, 1724, 1916, 2114, 2331, 2559, 2795, 3041, 3301, 3571, 3850, 4138, 4447, 4762, 5096, 5444, 5800, 6170, 6551, 6944, 7349, 7769, 8201, 8642, 9095, 9557, 10030
OFFSET
1,1
REFERENCES
H. L. Nelson, "Prime Sums", J. Rec. Math., 14 (1981), 205-206.
LINKS
Eric Weisstein's World of Mathematics, Prime Sums.
FORMULA
Asymptotically b(n) ~ 2 * n^2 * (log 2 + log(n)). - Jonathan Vos Post, Nov 29 2005
b(n) = (1 + A007504(2*n))/2. - Jonathan Vos Post, Nov 29 2005
MATHEMATICA
a[0] = 1/2; a[n_] := a[n] = a[n - 1] + Prime[n]/2 bb = Table[a[2*n], {n, 1, 200}]
CROSSREFS
Sequence in context: A014857 A177817 A292392 * A007518 A029494 A059774
KEYWORD
nonn
AUTHOR
Roger L. Bagula, Nov 28 2005
STATUS
approved