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 A331071 #17 Mar 05 2020 04:11:36
%S A331071 1,33,65,65,97,353,353,353,401,465,593,593,593,849,849,849,881,1265,
%T A331071 1297,1297,1553,1553,1553,1553,1553,2129,2385,2385,2385,2897,2897,
%U A331071 2897,2961,2961,3217,3217,3249,3505,3505,3505,3633,4145,4145,4145,4145,4401,4401,4401,4401,4497,5073,5073,5201,5713,5713
%N A331071 a(n) = Sum_{k <= n} r_2(k)^2*d(k+1), where r_2 = A004018, d = A000005.
%C A331071 Partial sums of A330574.
%D A331071 Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 163.
%H A331071 Amiram Eldar, <a href="/A331071/b331071.txt">Table of n, a(n) for n = 0..10000</a>
%H A331071 Karl-Heinz Indlekofer, <a href="https://doi.org/10.1007/BF01304942">Eine asymptotische Formel in der Zahlentheorie</a>, (German) Arch. Math. (Basel) 23 (1972), 619-624. MR0318080 (47 #6629).
%F A331071 a(n) ~ c * n * log(n)^2, where c is a constant. - _Amiram Eldar_, Mar 05 2020
%t A331071 Accumulate @ Table[SquaresR[2, n]^2 * DivisorSigma[0, n+1], {n, 0, 50}] (* _Amiram Eldar_, Mar 05 2020 *)
%Y A331071 Cf. A000005, A004018, A330574.
%K A331071 nonn
%O A331071 0,2
%A A331071 _N. J. A. Sloane_, Jan 10 2020