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 A123119 #19 Jan 26 2019 19:35:14
%S A123119 1,1,2,2,2,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,4,4,4,4,4,4,4,4,4,4,
%T A123119 4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4,5,
%U A123119 5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5
%N A123119 Number of digits in sum of first n primes (A007504).
%C A123119 Since A007504(n) has the asymptotic expression ~ n^2 * log(n) / 2, a(n) has the asymptotic expression n^2 * log(n) / 2 = floor(log_10(10* n^2 * log(n) / 2)) = floor(log_10(5* n^2 * log(n))) = floor(log_10(5) + log_10(n^2) + log_10(log(n))) = floor(0.698970004 + 2*log_10(n) + log_10(log(n))). What is the smallest n such that a(n) = 5, 6, 7, ...?
%H A123119 Harvey P. Dale, <a href="/A123119/b123119.txt">Table of n, a(n) for n = 1..1000</a>
%F A123119 a(n) = A055642(A007504(n)) = floor(log_10(10*A007504(n))) = A004216(A007504(n)) + 1 = A004218(A007504(n) + 1).
%e A123119 a(3) = 2 because 2 + 3 + 5 = 10 has 2 digits in its decimal expansion.
%t A123119 f[n_] := Floor[ Log[10, Sum[Prime@i, {i, n}]] + 1]; Array[f, 105] (* _Robert G. Wilson v_ *)
%t A123119 f[n_] := IntegerLength[Total[Prime[Range[n]]]]; Array[f, 105] (* _Jan Mangaldan_, Jan 04 2017 *)
%t A123119 IntegerLength/@Accumulate[Prime[Range[110]]] (* _Harvey P. Dale_, Jan 26 2019 *)
%Y A123119 Cf. A000040, A000041, A004216, A004218, A034386, A055642, A111287.
%K A123119 base,nonn
%O A123119 1,3
%A A123119 _Jonathan Vos Post_, Sep 28 2006
%E A123119 More terms from _Robert G. Wilson v_, Oct 05 2006