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 A024925 #17 Sep 08 2022 08:44:48
%S A024925 1,2,4,9,13,19,25,38,52,64,74,92,104,122,143,172,188,218,236,268,299,
%T A024925 329,351,393,437,473,523,569,597,646,676,737,788,836,893,959,995,1049,
%U A024925 1110,1182,1222,1293,1335,1409,1490,1556,1602,1692,1782,1874,1955,2043,2095,2197,2290
%N A024925 Sum of remainders of n mod prime(k), for k = 1,2,3,...,n.
%F A024925 G.f.: x * (1 + x)/(1 - x)^3 - (1/(1 - x)) * Sum_{k>=1} prime(k) * x^prime(k)/(1 - x^prime(k)). - _Ilya Gutkovskiy_, Jul 16 2019
%o A024925 (Magma) [&+[n mod NthPrime(k): k in [1..n]]:n in [1..55]]; // _Marius A. Burtea_, Jul 16 2019
%o A024925 (PARI) a(n) = sum(k=1, n, n % prime(k)); \\ _Michel Marcus_, Jul 18 2019
%o A024925 (PARI) a(n) = my(s=0); forprime(p=2, prime(n), s += n%p); s; \\ _Michel Marcus_, Jul 18 2019
%Y A024925 Cf. A004125, A024934.
%K A024925 nonn
%O A024925 1,2
%A A024925 _Clark Kimberling_