A178138 -id:A178138 - cp's OEIS frontend

A007504 Sum of the first n primes.

0, 2, 5, 10, 17, 28, 41, 58, 77, 100, 129, 160, 197, 238, 281, 328, 381, 440, 501, 568, 639, 712, 791, 874, 963, 1060, 1161, 1264, 1371, 1480, 1593, 1720, 1851, 1988, 2127, 2276, 2427, 2584, 2747, 2914, 3087, 3266, 3447, 3638, 3831, 4028, 4227, 4438, 4661, 4888

Offset: 0

N. J. A. Sloane, Robert G. Wilson v

It appears that a(n)^2 - a(n-1)^2 = A034960(n). - Gary Detlefs, Dec 20 2011
This is true. Proof: By definition we have A034960(n) = Sum_{k = (a(n-1)+1)..a(n)} (2*k-1). Since Sum_{k = 1..n} (2*k-1) = n^2, it follows A034960(n) = a(n)^2 - a(n-1)^2, for n > 1. - Hieronymus Fischer, Sep 27 2012 [formulas above adjusted to changed offset of A034960 - Hieronymus Fischer, Oct 14 2012]
Row sums of the triangle in A037126. - Reinhard Zumkeller, Oct 01 2012
Ramanujan noticed the apparent identity between the prime parts partition numbers A000607 and the expansion of Sum_{k >= 0} x^a(k)/((1-x)...(1-x^k)), cf. A046676. See A192541 for the difference between the two. - M. F. Hasler, Mar 05 2014
For n > 0: row 1 in A254858. - Reinhard Zumkeller, Feb 08 2015
a(n) is the smallest number that can be partitioned into n distinct primes. - Alonso del Arte, May 30 2017
For a(n) < m < a(n+1), n > 0, at least one m is a perfect square.
Proof: For n = 1, 2, ..., 6, the proposition is clear. For n > 6, a(n) < ((prime(n) - 1)/2)^2, set (k - 1)^2 <= a(n) < k^2 < ((prime(n) + 1)/2)^2, then k^2 < (k - 1)^2 + prime(n) <= a(n) + prime(n) = a(n+1), so m = k^2 is this perfect square. - Jinyuan Wang, Oct 04 2018
For n >= 5 we have a(n) < ((prime(n)+1)/2)^2. This can be shown by noting that ((prime(n)+1)/2)^2 - ((prime(n-1)+1)/2)^2 - prime(n) = (prime(n)+prime(n-1))*(prime(n)-prime(n-1)-2)/4 >= 0. - Jianing Song, Nov 13 2022
Washington gives an oscillation formula for |a(n) - pi(n^2)|, see links. - Charles R Greathouse IV, Dec 07 2022

E. Bach and J. Shallit, §2.7 in Algorithmic Number Theory, Vol. 1: Efficient Algorithms, MIT Press, Cambridge, MA, 1996.
H. L. Nelson, "Prime Sums", J. Rec. Math., 14 (1981), 205-206.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

R. J. Mathar, Table of n, a(n) for n = 0..100000
C. Axler, On a Sequence involving Prime Numbers, J. Int. Seq. 18 (2015) # 15.7.6.
Christian Axler, New bounds for the sum of the first n prime numbers, arXiv:1606.06874 [math.NT], 2016.
P. Hecht, Post-Quantum Cryptography: S_381 Cyclic Subgroup of High Order, International Journal of Advanced Engineering Research and Science (IJAERS, 2017) Vol. 4, Issue 6, 78-86.
R. J. Mathar, Table of 100000n, a(100000n) for n = 1..10000
Romeo Meštrović, Curious conjectures on the distribution of primes among the sums of the first 2n primes, arXiv:1804.04198 [math.NT], 2018.
Vladimir Shevelev, Asymptotics of sum of the first n primes with a remainder term
Nilotpal Kanti Sinha, On the asymptotic expansion of the sum of the first n primes, arXiv:1011.1667 [math.NT], 2010-2015.
Lawrence C. Washington, Sums of Powers of Primes II, arXiv preprint (2022). arXiv:2209.12845 [math.NT]
Eric Weisstein's World of Mathematics, Prime Sums
OEIS Wiki, Sums of powers of primes divisibility sequences

Cf. A000041, A034386, A111287, A013916, A013918 (primes), A045345, A050247, A050248, A068873, A073619, A034387, A014148, A014150, A178138, A254784, A254858.
See A122989 for the value of Sum_{n >= 1} 1/a(n).
Cf. A008472, A002110, A038107.

P:=Filtered([1..250],IsPrime);;
a:=Concatenation([0],List([1..Length(P)],i->Sum([1..i],k->P[k]))); # Muniru A Asiru, Oct 07 2018

a007504 n = a007504_list !! n
a007504_list = scanl (+) 0 a000040_list
-- Reinhard Zumkeller, Oct 01 2014, Oct 03 2011

[0] cat [&+[ NthPrime(k): k in [1..n]]: n in [1..50]]; // Bruno Berselli, Apr 11 2011 (adapted by Vincenzo Librandi, Nov 27 2015 after Hasler's change on Mar 05 2014)

s1:=[2]; for n from 2 to 1000 do s1:=[op(s1),s1[n-1]+ithprime(n)]; od: s1;
A007504 := proc(n)
    add(ithprime(i), i=1..n) ;
end proc: # R. J. Mathar, Sep 20 2015

Accumulate[Prime[Range[100]]] (* Zak Seidov, Apr 10 2011 *)
primeRunSum = 0; Table[primeRunSum = primeRunSum + Prime[k], {k, 100}] (* Zak Seidov, Apr 16 2011 *)

A007504(n) = sum(k=1,n,prime(k)) \\ Michael B. Porter, Feb 26 2010

a(n) = vecsum(primes(n)); \\ Michel Marcus, Feb 06 2021

from itertools import accumulate, count, islice
from sympy import prime
def A007504_gen(): return accumulate(prime(n) if n > 0 else 0 for n in count(0))
A007504_list = list(islice(A007504_gen(),20)) # Chai Wah Wu, Feb 23 2022

a(n) ~ n^2 * log(n) / 2. - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 24 2001 (see Bach & Shallit 1996)
a(n) = A014284(n+1) - 1. - Jaroslav Krizek, Aug 19 2009
a(n+1) - a(n) = A000040(n+1). - Jaroslav Krizek, Aug 19 2009
a(A051838(n)) = A002110(A051838(n)) / A116536(n). - Reinhard Zumkeller, Oct 03 2011
a(n) = min(A068873(n), A073619(n)) for n > 1. - Jonathan Sondow, Jul 10 2012
a(n) = A033286(n) - A152535(n). - Omar E. Pol, Aug 09 2012
For n >= 3, a(n) >= (n-1)^2 * (log(n-1) - 1/2)/2 and a(n) <= n*(n+1)*(log(n) + log(log(n))+ 1)/2. Thus a(n) = n^2 * log(n) / 2 + O(n^2*log(log(n))). It is more precise than in Fares's comment. - Vladimir Shevelev, Aug 01 2013
a(n) = (n^2/2)*(log n + log log n - 3/2 + (log log n - 3)/log n + (2 (log log n)^2 - 14 log log n + 27)/(4 log^2 n) + O((log log n/log n)^3)) [Sinha]. - Charles R Greathouse IV, Jun 11 2015
G.f: (x*b(x))/(1-x), where b(x) is the g.f. of A000040. - Mario C. Enriquez, Dec 10 2016
a(n) = A008472(A002110(n)), for n > 0. - Michel Marcus, Jul 16 2020

More terms from Stefan Steinerberger, Apr 11 2006

a(0) = 0 prepended by M. F. Hasler, Mar 05 2014

A014148 a(n) = Sum_{m=1..n} Sum_{k=1..m} prime(k).

Original entry on oeis.org

2, 7, 17, 34, 62, 103, 161, 238, 338, 467, 627, 824, 1062, 1343, 1671, 2052, 2492, 2993, 3561, 4200, 4912, 5703, 6577, 7540, 8600, 9761, 11025, 12396, 13876, 15469, 17189, 19040, 21028, 23155, 25431, 27858, 30442, 33189, 36103, 39190, 42456, 45903

Offset: 1

N. J. A. Sloane

nonn

Previous name was: Apply partial sum operator twice to sequence of primes.
Numbers n such that a(n) is prime are listed in A122381(n) = {1, 2, 3, 6, 10, 23, 31, 46, 55, 58, 66, 70, 82, 91, 118, 131, 151, 163, 182, 187, 198, 199, ...}. Corresponding primes a(n) = a( A122381(n) ) = A122382(n) = {2, 7, 17, 103, 467, 6577, 17189, 61627, 109919, 130531, 198109, 239579, 399557, 559313, ...}. - Alexander Adamchuk, Aug 30 2006
Row 2 in A254858. - Reinhard Zumkeller, Feb 08 2015
Partial sums of A007504, n>=1. - Omar E. Pol, Nov 23 2016

Harvey P. Dale, Table of n, a(n) for n = 1..10000 [extending prior b-File from Alexander Adamchuk]

Cf. A000040, A007504, A014150, A122381, A122382, A178138, A254784, A254858.

a014148 n = a014148_list !! (n-1)
a014148_list = (iterate (scanl1 (+)) a000040_list) !! 2
-- Reinhard Zumkeller, Feb 08 2015

b:= proc(n) option remember; `if`(n<1, [0$2],
      (p-> p+[ithprime(n), p[1]])(b(n-1)))
    end:
a:= n-> b(n+1)[2]:
seq(a(n), n=1..42);  # Alois P. Heinz, Oct 07 2021

Table[Sum[Sum[Prime[k],{k,1,m}],{m,1,n}],{n,1,100}] (* Alexander Adamchuk, Aug 30 2006 *)
Accumulate[Accumulate[Prime[Range[50]]]] (* Harvey P. Dale, Dec 29 2011 *)

Convolution of the primes with the positive integers: Sum_{k=1..n} (n-k+1)*prime(k). - David Scambler, Oct 08 2006

More terms from Alexander Adamchuk, Aug 30 2006

Name changed by Wesley Ivan Hurt, Oct 04 2021

A014150 Apply partial sum operator thrice to primes.

Original entry on oeis.org

2, 9, 26, 60, 122, 225, 386, 624, 962, 1429, 2056, 2880, 3942, 5285, 6956, 9008, 11500, 14493, 18054, 22254, 27166, 32869, 39446, 46986, 55586, 65347, 76372, 88768, 102644, 118113, 135302, 154342, 175370

Offset: 1

N. J. A. Sloane

nonn

Row 3 in A254858. - Reinhard Zumkeller, Feb 08 2015

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Cf. A000040.
Cf. A007504, A014148, A178138, A254784.
Cf. A254858.

a014150 n = a014150_list !! (n-1)
a014150_list = (iterate (scanl1 (+)) a000040_list) !! 3
-- Reinhard Zumkeller, Feb 08 2015

lst={};s1=0;s2=0;s3=0;Do[s1=s1+Prime[n];s2=s2+s1;s3=s3+s2;AppendTo[lst, s3], {n, 5!}];lst (* Vladimir Joseph Stephan Orlovsky, Sep 15 2008 *)
With[{nn=3},Nest[Accumulate[#]&,Prime[Range[50]],nn]] (* Harvey P. Dale, Feb 07 2015 *)

Offset fixed by Reinhard Zumkeller, Feb 08 2015

A254858 Iterated partial sums of prime numbers, square array read by diagonals.

Original entry on oeis.org

2, 2, 3, 2, 5, 5, 2, 7, 10, 7, 2, 9, 17, 17, 11, 2, 11, 26, 34, 28, 13, 2, 13, 37, 60, 62, 41, 17, 2, 15, 50, 97, 122, 103, 58, 19, 2, 17, 65, 147, 219, 225, 161, 77, 23, 2, 19, 82, 212, 366, 444, 386, 238, 100, 29, 2, 21, 101, 294, 578, 810, 830, 624, 338, 129, 31

Offset: 0

Reinhard Zumkeller, Feb 08 2015

Row n+1 = partial sums of row n.

T(n,1) = A002522(n+1); T(n,2) = A144396(n+1); T(n,3) = A002522(n+2).

			. n\k | 1  2  3   4   5    6    7     8     9    10    11     12     13
. ----+------------------------------------------------------------------
.  0  | 2  3  5   7  11   13   17    19    23    29    31     37     41 ..
.  1  | 2  5 10  17  28   41   58    77   100   129   160    197    238 ..
.  2  | 2  7 17  34  62  103  161   238   338   467   627    824   1062 ..
.  3  | 2  9 26  60 122  225  386   624   962  1429  2056   2880   3942 ..
.  4  | 2 11 37  97 219  444  830  1454  2416  3845  5901   8781  12723 ..
.  5  | 2 13 50 147 366  810 1640  3094  5510  9355 15256  24037  36760 ..
.  6  | 2 15 65 212 578 1388 3028  6122 11632 20987 36243  60280  97040 ..
.  7  | 2 17 82 294 872 2260 5288 11410 23042 44029 80272 140552 237592 ...

Reinhard Zumkeller, Table of n, a(n) for n = 0..7259, first 120 diagonals.

Cf. A000040 (row 0), A007504 (row 1), A014148 (row 2), A014150 (row 3), A178138 (row 4), A254784 (row 5).
Cf. A007395 (column 1), A144396 (column 2), A002522 (column 3).
Cf. A125180 (antidiagonal sums), A125179 (diagonals downward).

a254858_tabl = diags [] $ iterate (scanl1 (+)) a000040_list where
   diags uss (vs:vss) = (map head wss) : diags (map tail wss) vss
                        where wss = vs : uss
a254858_list = concat a254858_tabl

nmax = 11;
row[0] = Prime[Range[nmax+1]];
row[n_] := row[n] = row[n-1] // Accumulate;
T[n_, k_] := row[n][[k]];
Table[T[n-k, k], {n, 0, nmax}, {k, 1, n}] // Flatten (* Jean-François Alcover, Oct 11 2021 *)

cp's OEIS Frontend

A007504 Sum of the first n primes.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

PARI

Python

Formula

Extensions

A014148 a(n) = Sum_{m=1..n} Sum_{k=1..m} prime(k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

Formula

Extensions

A014150 Apply partial sum operator thrice to primes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Extensions

A254858 Iterated partial sums of prime numbers, square array read by diagonals.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Mathematica

A254784 Apply partial sum operator 5 times to primes.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

A023538 Convolution of natural numbers with (1, p(1), p(2), ... ), where p(k) is the k-th prime.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula

A293210 a(n) = [x^n] (1/(1 - x)^n)*Sum_{k>=1} prime(k)*x^k.

Views

Author

Keywords

Crossrefs

Programs

A293210 a(n) = [x^n] (1/(1 - x)^n)Sum_{k>=1} prime(k)x^k.