|
%I #32 Oct 07 2021 21:52:56
%S 2,7,17,34,62,103,161,238,338,467,627,824,1062,1343,1671,2052,2492,
%T 2993,3561,4200,4912,5703,6577,7540,8600,9761,11025,12396,13876,15469,
%U 17189,19040,21028,23155,25431,27858,30442,33189,36103,39190,42456,45903
%N a(n) = Sum_{m=1..n} Sum_{k=1..m} prime(k).
%C Previous name was: Apply partial sum operator twice to sequence of primes.
%C 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
%C Row 2 in A254858. - _Reinhard Zumkeller_, Feb 08 2015
%C Partial sums of A007504, n>=1. - _Omar E. Pol_, Nov 23 2016
%H Harvey P. Dale, <a href="/A014148/b014148.txt">Table of n, a(n) for n = 1..10000</a> [extending prior b-File from Alexander Adamchuk]
%F Convolution of the primes with the positive integers: Sum_{k=1..n} (n-k+1)*prime(k). - _David Scambler_, Oct 08 2006
%p b:= proc(n) option remember; `if`(n<1, [0$2],
%p (p-> p+[ithprime(n), p[1]])(b(n-1)))
%p end:
%p a:= n-> b(n+1)[2]:
%p seq(a(n), n=1..42); # _Alois P. Heinz_, Oct 07 2021
%t Table[Sum[Sum[Prime[k],{k,1,m}],{m,1,n}],{n,1,100}] (* _Alexander Adamchuk_, Aug 30 2006 *)
%t Accumulate[Accumulate[Prime[Range[50]]]] (* _Harvey P. Dale_, Dec 29 2011 *)
%o (Haskell)
%o a014148 n = a014148_list !! (n-1)
%o a014148_list = (iterate (scanl1 (+)) a000040_list) !! 2
%o -- _Reinhard Zumkeller_, Feb 08 2015
%Y Cf. A000040, A007504, A014150, A122381, A122382, A178138, A254784, A254858.
%K nonn
%O 1,1
%A _N. J. A. Sloane_.
%E More terms from _Alexander Adamchuk_, Aug 30 2006
%E Name changed by _Wesley Ivan Hurt_, Oct 04 2021
|
