%I #14 Mar 05 2020 04:11:27
%S 1,32,32,0,32,256,0,0,48,64,128,0,0,256,0,0,32,384,32,0,256,0,0,0,0,
%T 576,256,0,0,512,0,0,64,0,256,0,32,256,0,0,128,512,0,0,0,256,0,0,0,96,
%U 576,0,128,512,0,0,0,0,128,0,0,256,0,0,64,2048,0,0,256,0,0,0,32,256,384,0,0,0,0,0,320,64,128,0,0
%N a(n) = r_2(n)^2*d(n+1), where r_2 = A004018, d = A000005.
%H Amiram Eldar, <a href="/A330574/b330574.txt">Table of n, a(n) for n = 0..10000</a>
%H 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).
%t Table[SquaresR[2, n]^2 * DivisorSigma[0, n+1], {n, 0, 100}] (* _Amiram Eldar_, Mar 05 2020 *)
%Y Cf. A000005, A004018, A331071.
%K nonn
%O 0,2
%A _N. J. A. Sloane_, Jan 10 2020
%E Offset corrected by _Amiram Eldar_, Mar 05 2020