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 A101306 #16 Jan 21 2019 19:01:55
%S A101306 2,5,10,17,18,21,28,37,40,49,50,57,58,61,68,71,80,81,88,89,92,101,104,
%T A101306 113,120,121,124,131,140,143,150,151,158,167,176,177,184,187,194,197,
%U A101306 206,207,208,211,218,227,228,231,238,247,250,259,260,261,268,271,280
%N A101306 a(n) = Sum_{i=1..n} {last digit of prime(i)}.
%C A101306 Asymptotically, a(n) ~ 5n by Dirichlet's theorem. - _Charles R Greathouse IV_, Sep 28 2008
%e A101306 a(1) = 2;
%e A101306 a(2) = 2 + 3 = 5;
%e A101306 a(3) = 2 + 3 + 5 = 10;
%e A101306 a(4) = 2 + 3 + 5 + 7 = 17;
%e A101306 a(5) = 2 + 3 + 5 + 7 + 1(1) = 2 + 3 + 5 + 7 + 1 = 18.
%t A101306 f[n_] := Sum[ Mod[ Prime[i], 10], {i, n}]; Array[ f, 60] (* _Robert G. Wilson v_, Dec 22 2004 *)
%t A101306 Rest@ FoldList[Plus, 0, Mod[Prime@ Range@ 60, 10]] (* _Robert G. Wilson v_, Jan 16 2011 *)
%o A101306 (PARI) sum(k=1,n,prime(k)%10) \\ _Charles R Greathouse IV_, Sep 28 2008
%Y A101306 Partial sums of A007652.
%K A101306 nonn,base,easy
%O A101306 1,1
%A A101306 _Jorge Coveiro_, Dec 22 2004
%E A101306 Corrected and extended by _Robert G. Wilson v_, Dec 22 2004