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 A097952 #28 Jul 04 2024 03:31:22
%S A097952 0,4,46,475,4719,46534,459970,4562537,45337545,451112256,4493162026,
%T A097952 44786187348,446664473808,4456613596481,44480880591963,
%U A097952 444075310669968,4434375640450064,44287795522995300,442382943864554586
%N A097952 Sum of the number of digits in the prime numbers less than 10^n.
%C A097952 Partial sums of A046719(n) = n*A006879(n). In other words, a(n) is the number of digits used in writing out all {A006880(n)} primes below 10^n. - _Lekraj Beedassy_, Dec 13 2007
%H A097952 Amiram Eldar, <a href="/A097952/b097952.txt">Table of n, a(n) for n = 0..28</a>
%F A097952 a(n) = Sum_{k=0..n} k * A006879(k). - _Amiram Eldar_, Jul 04 2024
%e A097952 There are 25 primes < 100; 4 of them are 1-digit numbers and 21 are 2-digit numbers. Thus a(2) = 4 + 21*2 = 46.
%t A097952 Accumulate[Table[n(PrimePi[10^n]-PrimePi[10^(n-1)]),{n,0,14}]] (* This generates the first 15 terms of the sequence, but if n exceeds 14 the function PrimePi in Mathematica cannot calculate it. *) (* _Harvey P. Dale_, Jun 13 2014 *)
%o A097952 (PARI) g(n) = for(j=0,n,s=0;forprime(x=2,10^j,y=length(Str(x));s+=y);print1(s","))
%Y A097952 Cf. A006879, A006880, A046719, A119290.
%K A097952 nonn,base
%O A097952 0,2
%A A097952 _Cino Hilliard_, Sep 05 2004
%E A097952 More terms derived from A006879 by _R. J. Mathar_, Oct 14 2010