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 A321973 #7 Dec 20 2018 23:21:27
%S A321973 0,1,6,16,36,62,112,162,242,332,462,584,784,954,1204,1464,1784,2074,
%T A321973 2524,2886,3406,3906,4516,5046,5846,6496,7346,8156,9156,9998,11298,
%U A321973 12260,13540,14760,16210,17510,19310,20680,22490,24190,26270,27952,30452,32302,34742
%N A321973 Partial sums of the Dedekind psi_2(k) function, for 1 <= k <= n.
%C A321973 In general, for m >= 1, Sum_{k=1..n} psi_m(k) = Sum_{k=1..n} mu(k)^2 * (Bernoulli(m+1, 1+floor(n/k)) - Bernoulli(m+1, 1)) / (m+1), where mu(k) is the Moebius function and Bernoulli(n,x) are the Bernoulli polynomials.
%C A321973 In general, for m >= 1, Sum_{k=1..n} psi_m(k) ~ n^(m+1) * zeta(m+1) / ((m+1) * zeta(2*(m+1))).
%H A321973 Wikipedia, <a href="https://en.wikipedia.org/wiki/Dedekind_psi_function">Dedekind psi function</a>
%F A321973 a(n) = Sum_{k=1..n} A065958(k).
%F A321973 a(n) ~ n^3 * zeta(3) / (3*zeta(6)).
%F A321973 a(n) = Sum_{k=1..n} mu(k)^2 * Bernoulli(3, 1+floor(n/k)) / 3.
%t A321973 a[n_] := Sum[MoebiusMu[k]^2 * BernoulliB[3, 1 + Floor[n/k]], {k, 1, n}]/3; Array[a, 50, 0] (* _Amiram Eldar_, Nov 23 2018 *)
%o A321973 (PARI) a(n) = sum(k=1, n, moebius(k)^2 * ((n\k)^3/3 + (n\k)^2/2 + (n\k)/6));
%Y A321973 Cf. A001615, A065958, A173290.
%K A321973 nonn,easy
%O A321973 0,3
%A A321973 _Daniel Suteu_, Nov 22 2018