This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A167214 #19 Jul 23 2025 10:50:35
%S A167214 2,10,30,68,140,246,406,616,900,1290,1760,2364,3094,3934,4920,6096,
%T A167214 7480,9018,10792,12780,14952,17402,20102,23112,26500,30186,34128,
%U A167214 38388,42920,47790,53320,59232,65604,72318,79660,87372,95608,104386,113646,123480
%N A167214 a(n) = (sum of first n primes) * n.
%C A167214 a(n) has the asymptotic expression a(n) ~ n^3 * log(n) / 2.
%H A167214 T. D. Noe, <a href="/A167214/b167214.txt">Table of n, a(n) for n = 1..1000</a>
%H A167214 Asymptotic Expression for a(n) is a direct extension of asymptotic expression for <a href="http://oeis.org/A007504">A007504</a>(n).
%F A167214 a(n) = n*A007504(n). - _R. J. Mathar_, Oct 31 2009
%p A167214 A007504 := proc(n) add(ithprime(i), i=1..n) ; end: A167214 := proc(n) n*A007504(n) ; end: seq(A167214(n), n=1..80) ; # _R. J. Mathar_, Oct 31 2009
%p A167214 seq(n*add(ithprime(j), j = 1 .. n), n = 1 .. 40); # _Emeric Deutsch_, Nov 01 2009
%t A167214 s=0; Table[s=s+Prime[n]; s*n, {n, 50}]
%t A167214 Module[{nn=50,spr},spr=Accumulate[Prime[Range[nn]]];Times@@@Thread[{Range[nn],spr}]] (* _Harvey P. Dale_, Jul 23 2025 *)
%K A167214 nonn,easy
%O A167214 1,1
%A A167214 _Pratik Poddar_, Oct 30 2009
%E A167214 More terms from _R. J. Mathar_ and _Emeric Deutsch_, Oct 31 2009