cp's OEIS Frontend

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.

A060046 Generalized sum of divisors function: third diagonal of A060047.

This page as a plain text file.
%I A060046 #22 Jul 30 2025 05:11:18
%S A060046 1,2,4,8,14,24,40,56,84,122,168,232,312,408,528,672,865,1078,1336,
%T A060046 1648,2002,2424,2912,3472,4116,4872,5744,6648,7752,8976,10304,11872,
%U A060046 13566,15424,17556,19896,22414,25256,28336,31584,35462,39482,43728,48664
%N A060046 Generalized sum of divisors function: third diagonal of A060047.
%H A060046 Seiichi Manyama, <a href="/A060046/b060046.txt">Table of n, a(n) for n = 9..10000</a>
%H A060046 G. E. Andrews and S. C. F. Rose, <a href="http://arxiv.org/abs/1010.5769">MacMahon's sum-of-divisors functions, Chebyshev polynomials, and Quasi-modular forms</a>, arXiv:1010.5769 [math.NT], 2010.
%H A060046 P. A. MacMahon, <a href="https://doi.org/10.1112/plms/s2-19.1.75">Divisors of numbers and their continuations in the theory of partitions</a>, Proc. London Math. Soc., 19 (1919), 75-113; Coll. Papers II, pp. 303-341.
%F A060046 G.f.: (t(1)^3-3*t(1)*t(2)+2*t(3))/6 where t(i) = Sum((x^(2*n-1)/(1-x^(2*n-1))^2)^i,n=1..inf), i=1..3. - _Vladeta Jovovic_, Sep 21 2007
%F A060046 G.f.: -(1/3) * ( Sum_{k>=3} (-1)^k * k * binomial(k+2,5) * q^(k^2) ) / ( 1 + 2 * Sum_{k>=1} (-q)^(k^2) ). - _Seiichi Manyama_, Sep 15 2023
%t A060046 nmax = 60; Drop[CoefficientList[Series[-1/3 * Sum[(-1)^k*k*Binomial[k + 2, 5]*x^(k^2), {k, 3, nmax}]/(1 + 2*Sum[(-x)^(k^2), {k, 1, nmax}]), {x, 0, nmax}], x], 9] (* _Vaclav Kotesovec_, Jul 30 2025 *)
%Y A060046 Cf. A015128.
%K A060046 nonn,easy
%O A060046 9,2
%A A060046 _N. J. A. Sloane_, Mar 19 2001
%E A060046 More terms from _Naohiro Nomoto_, Jan 24 2002
%E A060046 More terms from _Vladeta Jovovic_, Sep 21 2007