Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #23 Oct 30 2023 01:45:39
%S 0,1,132,2196,16912,78150,289872,823592,2164800,4802733,10315800,
%T 19487292,37138752,62748686,108714144,171617400,277094656,410338962,
%U 633960756,893872100,1321672800,1808608032,2572322544,3404825976,4753900800,6105469375,8282826552
%N Expansion of phi_{7, 2}(x) where phi_{r, s}(x) = Sum_{n, m>0} m^r * n^s * x^{m*n}.
%C Multiplicative because A001160 is. - _Andrew Howroyd_, Jul 25 2018
%H Seiichi Manyama, <a href="/A282751/b282751.txt">Table of n, a(n) for n = 0..1000</a>
%F a(n) = n^2*A001160(n) for n > 0.
%F a(n) = (2*A282101(n) - A282595(n) - A013974(n))/1728.
%F Sum_{k=1..n} a(k) ~ zeta(6) * n^8 / 8. - _Amiram Eldar_, Sep 06 2023
%F From _Amiram Eldar_, Oct 30 2023: (Start)
%F Multiplicative with a(p^e) = p^(2*e) * (p^(5*e+5)-1)/(p^5-1).
%F Dirichlet g.f.: zeta(s-2)*zeta(s-7). (End)
%t Table[n^2 * DivisorSigma[5, n], {n, 0, 30}] (* _Amiram Eldar_, Sep 06 2023 *)
%o (PARI) a(n) = if(n < 1, 0, n^2*sigma(n, 5)) \\ _Andrew Howroyd_, Jul 25 2018
%Y Cf. A282097 (phi_{3, 2}), A282099 (phi_{5, 2}), this sequence (phi_{7, 2}), A282753 (phi_{9, 2}).
%Y Cf. A282101 (E_2*E_4^2), A282595 (E_2^2*E_6), A013974 (E_4*E_6 = E_10).
%Y Cf. A001160 (sigma_5(n)), A282050 (n*sigma_5(n)), this sequence (n^2*sigma_5(n)).
%Y Cf. A013664.
%K nonn,easy,mult
%O 0,3
%A _Seiichi Manyama_, Feb 21 2017