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 A279910 #12 Dec 24 2016 09:20:01
%S A279910 0,0,3,3,8,11,18,18,21,26,37,40,53,60,68,68,85,88,107,112,122,133,156,
%T A279910 159,164,177,180,187,216,224,255,255,269,286,298,301,338,357,373,378,
%U A279910 419,429,472,483,491,514,561,564,571,576,596,609,662,665,681,688,710,739,798,806,867,898,908,908,926,940,1007,1024,1050,1062
%N A279910 a(n) = Sum_{k=1..n} prime(k+1)*floor(n/prime(k+1)).
%C A279910 Sum of all odd prime divisors of all positive integers <= n.
%H A279910 <a href="/index/Su#sums_of_divisors">Index entries for sequences related to sums of divisors</a>
%F A279910 G.f.: (1/(1 - x))*Sum_{k>=2} prime(k)*x^prime(k)/(1 - x^prime(k)).
%F A279910 a(n) = -2*floor(n/2) + Sum_{k=1..n} prime(k)*floor(n/prime(k)) .
%F A279910 a(n) = A024924(n) - A052928(n).
%e A279910 For n = 7 the odd prime divisors of the first seven positive integers are {0}, {0}, {3}, {0}, {5}, {3}, {7} so a(7) = 0 + 0 + 3 + 0 + 5 + 3 + 7 = 18.
%t A279910 Table[Sum[Prime[k + 1] Floor[n/Prime[k + 1]], {k, 1, n}], {n, 70}]
%t A279910 Rest[nmax = 70; CoefficientList[Series[(1/(1 - x)) Sum[Prime[k] x^Prime[k]/(1 - x^Prime[k]), {k, 2, nmax}], {x, 0, nmax}], x]]
%Y A279910 Cf. A005069, A008472, A024924, A052928.
%K A279910 nonn,easy
%O A279910 1,3
%A A279910 _Ilya Gutkovskiy_, Dec 24 2016