A008441 -id:A008441 - cp's OEIS frontend

A053692 Number of self-conjugate 4-core partitions of n.

1, 1, 0, 1, 1, 1, 1, 1, 0, 0, 2, 0, 1, 1, 1, 2, 0, 0, 1, 1, 0, 1, 1, 0, 1, 2, 0, 2, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 3, 1, 0, 1, 0, 2, 1, 0, 1, 1, 1, 0, 1, 0, 0, 2, 0, 1, 0, 1, 2, 2, 0, 1, 0, 0, 2, 1, 1, 1, 2, 0, 0, 0, 0, 1, 1, 0, 2, 1, 0, 1, 1, 0, 1, 2, 0

Offset: 0

James Sellers, Feb 14 2000

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).

Also the number of positive odd solutions to equation x^2 + 4*y^2 = 8*n + 5. - Seiichi Manyama, May 28 2017

			G.f. = 1 + x + x^3 + x^4 + x^5 + x^6 + x^7 + 2*x^10 + x^12 + x^13 + x^14 + 2*x^15 + ...
G.f. = q^5 + q^13 + q^29 + q^37 + q^45 + q^53 + q^61 + 2*q^85 + q^101 + q^109 + ...

B. C. Berndt, Ramanujan's Notebooks Part IV, Springer-Verlag, see p. 153 Entry 22.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
F. Garvan, D. Kim and D. Stanton, Cranks and t-cores, Inventiones Math. 101 (1990) 1-17.
Christopher R. H. Hanusa and Rishi Nath, The number of self-conjugate core partitions, arxiv:1201.6629 [math.NT], 2012. See Table 1 p. 15.
David J. Hemmer, Generating functions for fixed points of the Mullineux map, arXiv:2402.03643 [math.CO], 2024. Table 1 p. 5 mentions this sequence.
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions

Cf. A008441, A053693.

A := Basis( ModularForms( Gamma1(64), 1), 701); A[6] + A[14] + A[30] - A[35] + A[36]; /* Michael Somos, Jun 21 2015 */;

a[ n_] := SeriesCoefficient[ EllipticTheta[ 2, 0, x (1/2)] EllipticTheta[ 2, 0, x^2] / (4 x^(5/8)), {x, 0, n}]; (* Michael Somos, Jun 21 2015 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ -x, x^2] QPochhammer[ x^8]^2, {x, 0, n}]; (* Michael Somos, Jun 21 2015 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ x^8]^2 QPochhammer[ x^2, x^4] / QPochhammer[ x, x^2], {x, 0, n}]; (* Michael Somos, Jun 21 2015 *)
a[ n_] := SeriesCoefficient[ (EllipticTheta[ 2, 0, q^2]^2 - 2 EllipticTheta[ 2, Pi/4, q^2]^2) / 16, {q, 0, 8 n + 5}]; (* Michael Somos, Jun 21 2015 *)
a[ n_] := If[ n < 0, 0, Sum[ (-1)^Quotient[d, 2], {d, Divisors[ 8 n + 5]}] / 2]; (* Michael Somos, Jun 21 2015 *)

{a(n) = my(A); if( n<0, 0, A = sum( k=0, ceil( sqrtint(8*n + 1)/2), x^((k^2 + k)/2), x * O(x^n)); polcoeff( A * subst(A + x * O(x^(n\4)), x, x^4), n))}; /* Michael Somos, Nov 03 2005 */

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x^2 + A)^2 * eta(x^8 + A)^2 / (eta(x + A) * eta(x^4 + A)), n))}; /* Michael Somos, Apr 28 2003 */

{a(n) = if( n<0, 0, sumdiv( 8*n + 5, d, (-1)^(d\2)) / 2)}; /* Michael Somos, Jun 21 2015*/

Expansion of psi(x) * psi(x^4) in powers of x where psi() is a Ramanujan theta function. - Michael Somos, Nov 03 2005
Expansion of chi(x) * f(-x^8)^2 in powers of x where chi(), f() are Ramanujan theta functions. - Michael Somos, Jul 24 2012
Expansion of f(x, x^7) * f(x^3, x^5) = f(x, x^3) * f(x^4, x^12) in powers of x where f(,) is the Ramanujan general theta function. - Michael Somos, Jun 21 2015
Expansion of (psi(x)^2 - psi(-x)^2) / (4*x) in powers of x^2 where psi() is a Ramanujan theta function. - Michael Somos, Jun 21 2015
Expansion of q^(-5/8) * eta(q^2)^2 * eta(q^8)^2 / (eta(q) * eta(q^4)) in powers of q. - Michael Somos, Apr 28 2003
Euler transform of period 8 sequence [ 1, -1, 1, 0, 1, -1, 1, -2, ...]. - Michael Somos, Apr 28 2003
a(n) = 1/2 * b(8*n + 5), where b(n) is multiplicative with b(2^e) = 0^e, b(p^e) = (1 + (-1)^e) / 2 if p == 3 (mod 4), b(p^e) = e+1 if p == 1 (mod 4). - Michael Somos, Jul 24 2012
G.f. is a period 1 Fourier series which satisfies f(-1 / (64 t)) = (t/i) g(t) where q = exp(2 Pi i t) and g() is the g.f. for A246950.
G.f.: Sum_{k in Z} x^k / (1 - x^(8*k + 5)). - Michael Somos, Nov 03 2005
G.f.: Sum_{k>0} -(-1)^k * x^((k^2 + k)/2) / (1 - x^(2*k - 1)). - Michael Somos, Jun 21 2015
G.f.: Product_{i>=1} (1-x^(8*i))^2*(1-x^(4*i-2))/(1-x^(2*i-1)).
a(9*n + 2) = a(9*n + 8) = 0. a(9*n + 5) = a(n). 2 * a(n) = A008441(2*n + 1).

A008439 Expansion of Jacobi theta constant theta_2^5 /32.

Original entry on oeis.org

1, 5, 10, 15, 25, 31, 35, 55, 60, 60, 90, 90, 95, 135, 125, 126, 170, 180, 175, 215, 220, 195, 285, 280, 245, 340, 300, 320, 405, 350, 351, 450, 465, 415, 515, 480, 425, 620, 590, 505, 655, 625, 590, 755, 660, 650, 805, 770, 755, 855, 841, 730, 1045, 960, 770, 1100

Offset: 0

N. J. A. Sloane

nonn

Also number of ways of writing n as a sum of five triangular numbers. - N. J. A. Sloane, Jun 01 2013

J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 102.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
K. Ono, S. Robins and P. T. Wahl, On the representation of integers as sums of triangular numbers, Aequationes mathematicae, August 1995, Volume 50, Issue 1-2, pp 73-94.

Number of ways of writing n as a sum of k triangular numbers, for k=1,...: A010054, A008441, A008443, A008438, A008439, A008440, A226252, A007331, A226253, A226254, A226255, A014787, A014809.

a002129[n_]:=-Sum[(-1)^d*d, {d, Divisors[n]}]; a[n_]:=a[n]=If[n==0, 1, 5 Sum[a002129[k] a[n - k], {k, n}]/n]; Table[a[n], {n, 0, 100}] (* Indranil Ghosh, Aug 02 2017 *)

a(0) = 1, a(n) = (5/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, May 06 2017

G.f.: exp(Sum_{k>=1} 5*(x^k/k)/(1 + x^k)). - Ilya Gutkovskiy, Jul 31 2017

More terms from Seiichi Manyama, May 05 2017

A008440 Expansion of Jacobi theta constant theta_2^6 /(64q^(3/2)).

Original entry on oeis.org

1, 6, 15, 26, 45, 66, 82, 120, 156, 170, 231, 276, 290, 390, 435, 438, 561, 630, 651, 780, 861, 842, 1020, 1170, 1095, 1326, 1431, 1370, 1716, 1740, 1682, 2016, 2145, 2132, 2415, 2550, 2353, 2850, 3120, 2810, 3321, 3486, 3285, 3906, 4005, 3722, 4350

Offset: 0

N. J. A. Sloane

Number of representations of n as sum of 6 triangular numbers. - Michel Marcus, Oct 24 2012. See the Ono et al. link.

			G.f. = 1 + 6*x + 15*x^2 + 26*x^3 + 45*x^4 + 66*x^5 + 82*x^6 + ... - _Michael Somos_, Jun 25 2019
G.f. = q^3 + 6*q^7 + 15*q^11 + 26*q^15 + 45*q^19 + 66*q^23 + 82*q^27 + ...

B. C. Berndt, Fragments by Ramanujan on Lambert series, in Number Theory and Its Applications, K. Gyory and S. Kanemitsu, eds., Kluwer, Dordrecht, 1999, pp. 35-49, see Entry 6.
J. H. Conway and N. J. A. Sloane, "Sphere Packings, Lattices and Groups", Springer-Verlag, p. 102.

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (terms 0..1000 from Vincenzo Librandi)
B. C. Berndt, Fragments by Ramanujan on Lambert series.
K. Ono, S. Robins and P. T. Wahl, On the representation of integers as sums of triangular numbers, Aequationes mathematicae, August 1995, Volume 50, Issue 1-2, pp 73-94. Theorem 4.

Number of ways of writing n as a sum of k triangular numbers, for k=1,...: A010054, A008441, A008443, A008438, A008439, A008440, A226252, A007331, A226253, A226254, A226255, A014787, A014809, A002173.

CoefficientList[(QPochhammer[q^2]^2 / QPochhammer[q])^6 + O[q]^50, q] (* Jean-François Alcover, Nov 05 2015 *)
a[ n_] := If[ n < 0, 0, -DivisorSum[ 4 n + 3, Re[I^(# - 1)] #^2 &] / 8]; (* Michael Somos, Jun 25 2019 *)

{a(n) = if( n<0, 0, polcoeff( sum(k=0, (sqrtint(8*n+1)-1)\2, x^((k^2+k)/2), x * O(x^n))^6, n))}; /* Michael Somos, May 23 2006 */

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x^2 + A)^2 / eta(x + A))^6, n))}; /* Michael Somos, May 23 2006 */

{a(n)= -sumdiv(4*n + 3, d, real(I^(d-1))*d^2)/8}; /* Michael Somos, Oct 24 2012 */

Expansion of Ramanujan phi^6(q) in powers of q.
Expansion of q^(-3/4)(eta(q^2)^2/eta(q))^6 in powers of q.
Euler transform of period 2 sequence [6, -6, ...]. - Michael Somos, May 23 2006
G.f.: (Sum_{n>=0} x^((n^2+n)/2))^6.
a(n) = (-1/8)*Sum_{d divides (4n+3)} Chi_2(4;d)*d^2. - Michel Marcus, Oct 24 2012. See the Ono et al. link. Theorem 4.
a(n) =(-1/8)*A002173(4*n+3). This is the preceding formula. - Wolfdieter Lang, Jan 12 2017
a(0) = 1, a(n) = (6/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, May 06 2017
G.f.: exp(Sum_{k>=1} 6*(x^k/k)/(1 + x^k)). - Ilya Gutkovskiy, Jul 31 2017

A002171 Glaisher's chi numbers. a(n) = chi(4*n + 1).

Original entry on oeis.org

1, -2, -3, 6, 2, 0, -1, -10, 0, -2, 10, 6, -7, 14, 0, -10, -12, 0, -6, 0, 9, -4, 10, 0, 18, -2, 0, 6, -14, -18, -11, 12, 0, 0, -22, 0, 20, 14, -6, 22, 0, 0, 23, -26, 0, -18, 4, 0, -14, -2, 0, -20, 0, 0, 0, 12, 3, 30, 26, 0, -30, 14, 0, 0, 2, 30, -28, -26, 0, -18, 10, 0, -13, -34, 0, 0, 20, 0, 26, 22, 0, -6, 0, 6, 18, 0

Offset: 0

N. J. A. Sloane

Number 49 of the 74 eta-quotients listed in Table I of Martin (1996).
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Glaisher (1884) essentially defines chi(n) as the sum over all solutions of n = x^2 + y^2 with even y and nonnegative odd x of x * (-1)^((x + y - 1)/2) and proves that it is multiplicative. If n is not == 1 (mod 4) then chi(n) = 0. - Michael Somos, Jun 18 2012
Denoted by g_2(q) in Cynk and Hulek on page 8 as the unique weight 2 level 32 newform. - Michael Somos, Aug 24 2012
This is a member of an infinite family of integer weight modular forms. g_1 = A008441, g_2 = A002171, g_3 = A000729, g_4 = A215601, g_5 = A215472. - Michael Somos, Aug 24 2012
The weight 2 level N = 32 newform (eta(q^4)*eta(q^8))^2 belongs to the elliptic curves y^2 = x^3 + 4*x , y^2 = x^3 - x, y^2 = x^3 - 11*x - 14 and y^2 = x^3 - 11*x + 14. See the Martin-Ono link, Theorem 2, row N = 32, and the Cremona link, Table 1, N = 32. - Wolfdieter Lang, Dec 26 2016

			G.f. = 1 - 2*x - 3*x^2 + 6*x^3 + 2*x^4 - x^6 - 10*x^7 - 2*x^9 + 10*x^10 + ...
G.f. (eta(q^4)*eta(q^8))^2 = q - 2*q^5 - 3*q^9 + 6*q^13 + 2*q^17 - q^25 - 10*q^29 - 2*q^37 + 10*q^41 + ...

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 0..10000 (first 1001 terms from T. D. Noe)
Amanda Clemm, Modular Forms and Weierstrass Mock Modular Forms, Mathematics, volume 4, issue 1, (2016)
J. E. Cremona, Algorithms for Modular Elliptic Curves.
S. Cynk and K. Hulek, Construction and examples of higher-dimensional modular Calabi-Yau manifolds, arXiv:math/0509424 [math.AG], 2005-2006.
S. R. Finch, Powers of Euler's q-Series, arXiv:math/0701251 [math.NT], 2007.
Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018.
J. W. L. Glaisher, On the function chi(n), Quarterly Journal of Pure and Applied Mathematics, 20 (1884), 97-167.
J. W. L. Glaisher, On the function chi(n), Quarterly Journal of Pure and Applied Mathematics, 20 (1884), 97-167. [Annotated scanned copy]
T. Ishikawa, Congruences between binomial coefficients binomial(2f,f) and Fourier coefficients of certain eta-products, Hiroshima Math. J. 22 (1992), no. 3, 583-590.
M. Koike, On McKay's conjecture, Nagoya Math. J., 95 (1984), 85-89.
Y. Martin, Multiplicative eta-quotients, Trans. Amer. Math. Soc. 348 (1996), no. 12, 4825-4856, see page 4852 Table I.
Yves Martin and Ken Ono, Eta-Quotients and Elliptic Curves, Proc. Amer. Math. Soc. 125, No 11 (1997), 3169-3176.
Michael Somos, Index to Yves Martin's list of 74 multiplicative eta-quotients and their A-numbers
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions
Index entries for sequences related to Glaisher's numbers

Cf. A000203, A002172, A278720, A279955.

A := Basis( ModularForms( Gamma0(32), 2), 341); A[2] - 2*A[6]; /* Michael Somos, Jun 12 2014 */

qEigenform( EllipticCurve( [0, 0, 0, -1, 0]), 341); /* Michael Somos, Jun 12 2014 */

Basis( CuspForms( Gamma0(32), 2), 341)[1]; /* Michael Somos, Mar 25 2015 */

max=100; f[x_] := Product[(1-x^k)*(1-x^(2k)), {k, 1, max}]^2; CoefficientList[ Series[ f[x], {x, 0, max}], x](* Jean-François Alcover, Jan 04 2012, after g.f. *)
a[ n_] := SeriesCoefficient[ (QPochhammer[ x] QPochhammer[ x^2])^2, {x, 0, n}]; (* Michael Somos, Jun 18 2012 *)
a[ n_] := SeriesCoefficient[ EllipticTheta[ 4, 0, x] QPochhammer[ x^2]^3, {x, 0, n}]; (* Michael Somos, Jun 18 2012 *)

{a(n) = if( n<0, 0, ellak( ellinit( [0, 0, 0, -1, 0], 1), 4*n + 1))}; /* Michael Somos, Jul 27 2006 */

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( (eta(x + A) * eta(x^2 + A))^2, n))}; /* Michael Somos, Jul 27 2006 */

{a(n) = my(A, p, e, x, y, a0, a1); if( n<0, 0, A = factor( 4*n + 1); prod( k=1, matsize(A)[1], [p, e] = A[k, ]; if( p==2, 0, p%4==3, (-p)^(e/2) * (1 + (-1)^e) / 2, forstep( i=1, sqrtint(p), 2, if( issquare( p - i^2, &y), x=i; break)); a0 = 1; y = a1 = x * (-1)^((x + y)\2) * if(y, 2, 1); for(i=2, e, x = y * a1 - p * a0; a0=a1; a1=x); a1 )))}; /* Michael Somos, Jun 18 2012 */

Expansion of (psi(x) * phi(-x))^2 = phi(-x) * f(-x^2)^3 in powers of x where phi(), psi(), f() are Ramanujan theta functions.
Expansion of q^(-1/4) * eta(q)^2 * eta(q^2)^2 in powers of q.
Euler transform of period 2 sequence [-2, -4, ...].
a(n) = b(4*n + 1) where b(n) is multiplicative with b(p^e) = b(p) * b(p^(e-1)) - p * b(p^(e-2)) and b(p) = p - number of solutions of y^2 = x^3 - x (mod p). - Michael Somos, Jul 27 2006. b(p(n)) = A278720(n). - Wolfdieter Lang, Dec 26 2016
G.f.: (Product_{k>0} (1 - x^k) * (1 - x^(2*k)))^2.
G.f.: Sum_{k>=0} a(k) * x^(4*k + 1) = (Sum_{k>=0} (-1)^k * (2*k + 1) * x^(2*k + 1)^2) * (Sum_{k in Z} (-1)^k * x^(4*k)^2).
Coefficients of L-series for elliptic curve "32a2": y^2 = x^3 - x.
G.f. is a period 1 Fourier series which satisfies f(-1 / (32 t)) = 32 (t/i)^2 f(t) where q = exp(2 Pi i t).
G.f.: exp(2*Sum_{k>=1} (sigma(2*k) - 4*sigma(k))*x^k/k). - Ilya Gutkovskiy, Sep 19 2018

A112610 Number of representations of n as a sum of two squares and two triangular numbers.

Original entry on oeis.org

1, 6, 13, 14, 18, 32, 31, 30, 48, 38, 42, 78, 57, 54, 80, 62, 84, 96, 74, 96, 121, 108, 90, 128, 98, 102, 192, 110, 114, 182, 133, 156, 176, 160, 138, 192, 180, 150, 234, 158, 192, 288, 183, 174, 240, 182, 228, 320, 194, 198, 272, 252, 240, 288, 256, 252, 403, 230

Offset: 0

James Sellers, Dec 21 2005

nonn

Also row sums of A239931, hence the sequence has a symmetric representation. - Omar E. Pol, Aug 30 2015

			a(1) = 6 since we can write 1 = 1^2 + 0^2 + 0 + 0 = (-1)^2 + 0^2 + 0 + 0 = 0^2 + 1^2 + 0 + 0 = 0^2 + (-1)^2 + 0 + 0 = 0^2 + 0^2 + 1 + 0 = 0^2 + 0^2 + 0 + 1

Amiram Eldar, Table of n, a(n) for n = 0..10001
M. D. Hirschhorn, The number of representations of a number by various forms, Discrete Mathematics 298 (2005), 205-211.

Cf. A000203, A193553, A237593, A239052, A239053, A239931.

[DivisorSigma(1, 4*n+1): n in [0..60]]; // Vincenzo Librandi, Sep 18 2015

Table[DivisorSigma[1, 4 n + 1], {n, 0, 57}] (* Michael De Vlieger, Aug 31 2015 *)

{a(n)=local(A); if(n<0, 0, A=x*O(x^n); polcoeff( eta(x^2+A)^14/eta(x+A)^6/eta(x^4+A)^4, n))} /* Michael Somos, Jul 04 2006 */

a(n) = sigma(4n+1) where sigma(n) = A000203(n) is the sum of the divisors of n.
Euler transform of period 4 sequence [ 6, -8, 6, -4, ...]. - Michael Somos, Jul 04 2006
Expansion of q^(-1/4)eta^14(q^2)/(eta^6(q)eta^4(q^4)) in powers of q. - Michael Somos, Jul 04 2006
Expansion of psi(q)^2*phi(q)^2, i.e., convolution of A004018 and A008441 [Hirschhorn]. - R. J. Mathar, Mar 24 2011
Sum_{k=0..n} a(k) = (Pi^2/4) * n^2 + O(n*log(n)). - Amiram Eldar, Dec 17 2022

A226252 Number of ways of writing n as the sum of 7 triangular numbers.

Original entry on oeis.org

1, 7, 21, 42, 77, 126, 175, 253, 357, 434, 567, 735, 833, 1057, 1302, 1400, 1708, 2037, 2191, 2597, 3003, 3151, 3619, 4242, 4389, 4935, 5691, 5740, 6594, 7434, 7371, 8400, 9303, 9506, 10626, 11592, 11585, 12761, 14427, 14203, 15519, 17241, 16808, 18788, 20559, 19950, 21882, 23898, 23786

Offset: 0

N. J. A. Sloane, Jun 01 2013

nonn

Seiichi Manyama, Table of n, a(n) for n = 0..10000
K. Ono, S. Robins and P. T. Wahl, On the representation of integers as sums of triangular numbers, Aequationes mathematicae, August 1995, Volume 50, Issue 1-2, pp 73-94.

Number of ways of writing n as a sum of k triangular numbers, for k=1,...: A010054, A008441, A008443, A008438, A008439, A008440, A226252, A007331, A226253, A226254, A226255, A014787, A014809.

G.f. is 7th power of g.f. for A010054.
a(0) = 1, a(n) = (7/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, May 06 2017
G.f.: exp(Sum_{k>=1} 7*(x^k/k)/(1 + x^k)). - Ilya Gutkovskiy, Jul 31 2017

A226253 Number of ways of writing n as the sum of 9 triangular numbers.

Original entry on oeis.org

1, 9, 36, 93, 198, 378, 633, 990, 1521, 2173, 2979, 4113, 5370, 6858, 8955, 11055, 13446, 16830, 20031, 23724, 28836, 33381, 38520, 45729, 52203, 59121, 68922, 77461, 86283, 99747, 110547, 121500, 138870, 152034, 166725, 188568, 204156, 221760, 248310, 268713, 289422, 321786, 345570, 369036

Offset: 0

N. J. A. Sloane, Jun 01 2013

nonn

Seiichi Manyama, Table of n, a(n) for n = 0..10000
K. Ono, S. Robins and P. T. Wahl, On the representation of integers as sums of triangular numbers, Aequationes mathematicae, August 1995, Volume 50, Issue 1-2, pp 73-94.

Number of ways of writing n as a sum of k triangular numbers, for k=1,...: A010054, A008441, A008443, A008438, A008439, A008440, A226252, A007331, A226253, A226254, A226255, A014787, A014809.

G.f. is 9th power of g.f. for A010054.
a(0) = 1, a(n) = (9/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, May 06 2017
G.f.: exp(Sum_{k>=1} 9*(x^k/k)/(1 + x^k)). - Ilya Gutkovskiy, Jul 31 2017

A226254 Number of ways of writing n as the sum of 10 triangular numbers from A000217.

Original entry on oeis.org

1, 10, 45, 130, 300, 612, 1105, 1830, 2925, 4420, 6341, 9000, 12325, 16290, 21645, 27932, 34980, 44370, 54900, 66430, 81702, 98050, 115440, 138330, 162565, 187800, 220545, 254800, 289265, 334890, 382058, 427350, 488700, 550420, 609960, 691812, 770185, 845750, 949365, 1049400, 1145580, 1274580

Offset: 0

N. J. A. Sloane, Jun 01 2013

nonn

Seiichi Manyama, Table of n, a(n) for n = 0..10000
K. Ono, S. Robins and P. T. Wahl, On the representation of integers as sums of triangular numbers, Aequationes mathematicae, August 1995, Volume 50, Issue 1-2, pp 73-94. Case k=10, Theorem 6.

Cf. A000217, A030212, A050456.

Number of ways of writing n as a sum of k triangular numbers, for k=1,...: A010054, A008441, A008443, A008438, A008439, A008440, A226252, A007331, A226253, A226254, A226255, A014787, A014809.

G.f. is 10th power of g.f. for A010054.
a(n) = (A050456(4*n+5) - A030212(4*n+5))/640. See the Ono et al. link, case k=10, Theorem 6. - Wolfdieter Lang, Jan 13 2017
a(0) = 1, a(n) = (10/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, May 06 2017
G.f.: exp(Sum_{k>=1} 10*(x^k/k)/(1 + x^k)). - Ilya Gutkovskiy, Jul 31 2017

A000729 Expansion of Product_{k >= 1} (1 - x^k)^6.

Original entry on oeis.org

1, -6, 9, 10, -30, 0, 11, 42, 0, -70, 18, -54, 49, 90, 0, -22, -60, 0, -110, 0, 81, 180, -78, 0, 130, -198, 0, -182, -30, 90, 121, 84, 0, 0, 210, 0, -252, -102, -270, 170, 0, 0, -69, 330, 0, -38, 420, 0, -190, -390, 0, -108, 0, 0, 0, -300, 99, 442, 210, 0, 418, -294, 0, 0, -510, 378, -540, 138, 0

Offset: 0

N. J. A. Sloane

This is Glaisher's function lambda(m). It appears to be defined only for odd m, and lambda(4t-1) = 0 (t >= 1), lambda(4t+1) = a(t) (t >= 0). - N. J. A. Sloane, Nov 25 2018
Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700).
Number 36 of the 74 eta-quotients listed in Table I of Martin (1996).
Dickson, v.2, p. 295 briefly states a result of Glaisher, 1883, pp 212-215. This result is that a(n) is the sum over all solutions of 16*n + 4 = x^2 + y^2 + z^2 + w^2 in nonnegative odd integers of chi(x) and is also the sum over all solutions of 8*n + 2 = x^2 + y^2 in nonnegative odd integers of chi(x) * chi(y) where chi(x) = x if x == 1 (mod 4) and -x if x == 3 (mod 4). [Michael Somos, Jun 18 2012]
Denoted by g_3(q) in Cynk and Hulek on page 8 as the unique weight 3 Hecke eigenform of level 16 with complex multiplication by i. - Michael Somos, Aug 24 2012
This is a member of an infinite family of integer weight modular forms. g_1 = A008441, g_2 = A002171, g_3 = A000729, g_4 = A215601, g_5 = A215472. - Michael Somos, Aug 24 2012

			G.f. = 1 - 6*x + 9*x^2 + 10*x^3 - 30*x^4 + 11*x^6 + 42*x^7 - 70*x^9 + 18*x^10 + ...
G.f. = q - 6*q^5 + 9*q^9 + 10*q^13 - 30*q^17 + 11*q^25 + 42*q^29 - 70*q^37 + ...

L. E. Dickson, History of the Theory of Numbers. Carnegie Institute Public. 256, Washington, DC, Vol. 1, 1919; Vol. 2, 1920; Vol. 3, 1923, see vol. 2, p. 295, and vol. 3, p. 134.
J. W. L. Glaisher, On the representations of a number as a sum of four squares, and on some allied arithmetical functions, Quarterly Journal of Pure and Applied Mathematics, 36 (1905), 305-358. See page 340.
J. W. L. Glaisher, The arithmetical functions P(m), Q(m), Omega(m), Quart. J. Math, 37 (1906), 36-48.
Morris Newman, A table of the coefficients of the powers of eta(tau). Nederl. Akad. Wetensch. Proc. Ser. A. 59 = Indag. Math. 18 (1956), 204-216.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Seiichi Manyama, Table of n, a(n) for n = 0..10000
M. Boylan, Exceptional congruences for the coefficients of certain eta-product newforms, J. Number Theory 98 (2003), no. 2, 377-389. MR1955423 (2003k:11071)
S. Cooper, M. D. Hirschhorn and R. Lewis, Powers of Euler's Product and Related Identities, The Ramanujan Journal, Vol. 4 (2), 137-155 (2000).
S. Cynk and K. Hulek, Construction and examples of higher-dimensional modular Calabi-Yau manifolds, arXiv:math/0509424 [math.AG], 2005-2006.
S. R. Finch, Powers of Euler's q-Series, arXiv:math/0701251 [math.NT], 2007.
J. W. L. Glaisher, Note on the Compositions of a Number as a Sum of Two and Four Uneven Squares, Quarterly Journal of Pure and Applied Mathematics, 19 (1883), 212-215.
J. W. L. Glaisher, On the function chi(n), Quarterly Journal of Pure and Applied Mathematics, 20 (1884), 97-167.
J. W. L. Glaisher, On the function chi(n), Quarterly Journal of Pure and Applied Mathematics, 20 (1884), 97-167. [Annotated scanned copy]
J. W. L. Glaisher, On the representations of a number as the sum of two, four, six, eight, ten, and twelve squares, Quart. J. Math. 38 (1907), 1-62 (see p. 5).
Y. Martin, Multiplicative eta-quotients, Trans. Amer. Math. Soc. 348 (1996), no. 12, 4825-4856, see page 4852 Table I.
S. Milne and V. Leininger, Some new infinite families of eta function identities, Methods and Applications of Analysis 6 (1999), 225--248.
M. Newman, A table of the coefficients of the powers of eta(tau), Nederl. Akad. Wetensch. Proc. Ser. A. 59 = Indag. Math. 18 (1956), 204-216. [Annotated scanned copy]
Michael Somos, Index to Yves Martin's list of 74 multiplicative eta-quotients and their A-numbers
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions
Index entries for expansions of Product_{k >= 1} (1-x^k)^m
Index entries for sequences mentioned by Glaisher

Powers of Euler's product: A000594, A000727 - A000731, A000735, A000739, A002107, A010815 - A010840.

A := Basis( ModularForms( Gamma1(16), 3), 274); A[2] - 6*A[6] + 9*A[10] + 10*A[14] - 30*A[18]; /* Michael Somos, May 17 2015 */

A := Basis( CuspForms( Gamma1(16), 3), 274); A[1] - 6*A[5]; /* Michael Somos, Jan 09 2017 */

a[ n_] := SeriesCoefficient[ 1/16 EllipticTheta[ 4, 0, q] EllipticTheta[ 2, 0, q]^4 EllipticTheta[ 3, 0, q], {q, 0, 4 n + 1}]; (* Michael Somos, Jun 18 2012 *)
a[ n_] := If[ n < 0, 0, With[ {m = Sqrt[ 16 n + 4]}, SeriesCoefficient[ Sum[ Mod[k, 2] q^k^2, {k, m}]^3 Sum[ KroneckerSymbol[ -4, k] k q^k^2, {k, m}], {q, 0, 16 n + 4}]]]; (* Michael Somos, Jun 12 2012 *)
a[ n_] := With[ {m = InverseEllipticNomeQ @ q}, SeriesCoefficient[ Sqrt[(1 - m) m ] (EllipticK[m] 2/Pi)^3 / (4 q^(1/2)), {q, 0, 2 n}]]; (* Michael Somos, Jun 22 2012 *)
a[ n_] := SeriesCoefficient[ Product[ 1 - x^k, {k, n}]^6, {x, 0, n}]; (* Michael Somos, May 17 2015 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ x]^6, {x, 0, n}]; (* Michael Somos, May 17 2015 *)
a[ n_] := SeriesCoefficient[ (-1/4) EllipticThetaPrime[ 1, -Pi/4, q] EllipticTheta[ 1, -Pi/4, q]^3, {q, 0, 4 n + 1}]; (* Michael Somos, May 17 2015 *)
a[ n_] := SeriesCoefficient[ (-1/16) EllipticThetaPrime[ 1, 0, q] EllipticTheta[ 1, -Pi/2, q]^3, {q, 0, 4 n + 1}]; (* Michael Somos, May 17 2015 *)

{a(n) = my(A); if( n<0, 0, A = x * O(x^n); polcoeff( eta(x + A)^6, n))};

{a(n) = my(A, p, e, x, y, a0, a1); if( n<0, 0, n = 4*n + 1; A = factor(n); prod( k=1, matsize(A)[1], [p, e] = A[k,]; if( p==2, 0, p%4==3, if( e%2, 0, p^e), forstep( i=1, sqrtint(p), 2, if( issquare( p - i^2, &y), x=i; break)); a0=1; a1 = y = 2*(x^2 - y^2); for( i=2, e, x = y*a1 - p^2*a0; a0=a1; a1=x); a1)))}; /* Michael Somos, Aug 21 2006 */

{a(n)=local(tn=(sqrtint(8*n+1)+1)\2);polcoeff(sum(m=0,tn,(1+2*m)^2*x^(m^2+m)+x*O(x^n)) + 2*sum(m=0,tn,sum(k=1,tn,(1+4*(m^2+m-k^2))*x^(m^2+m+k^2)+x*O(x^n))),n)} /* Paul D. Hanna, Mar 15 2010 */

Expansion of q^(-1/4)/16 * theta_2(q)^4 * theta_3(q) * theta_4(q) in powers of q. - [Dickson, v. 3, p. 134] from Stieltjes footnote 160. Michael Somos, Jun 18 2012
Expansion of q^(-1/2) / 4 * k * k' * (K / (pi/2))^3 in powers of q^2 where k, k', K are Jacobi elliptic functions. - Michael Somos, Jun 22 2012
G.f.: Product_{k>0}(1 - x^k)^6.
Given g.f. A(x), then A(q^4) = f(-q^4)^6 = phi(q) * phi(-q) * psi(q^2)^4 where phi(), psi(), f() are Ramanujan theta functions. - Michael Somos, Aug 23 2006
a(n) = b(4*n + 1) where b(n) is multiplicative with b(2^e) = 0^e, b(p^e) = p^e * (1 + (-1)^e) / 2 if p == 3 (mod 4), b(p^e) = b(p) * b(p^(e-1)) - b(p^(e-2)) * p^2 if p == 1 (mod 4) and b(p) = 2 * (x^2 - y^2) where p = x^2 + y^2 and y is even. - Michael Somos, Aug 23 2006
G.f. is a period 1 Fourier series which satisfies f(-1 / (16 t)) = 64 (t/i)^3 f(t) where q = exp(2 Pi i t). - Michael Somos, Aug 24 2012
G.f.: Sum_{k>=0} a(k) * x^(4*k + 1) = (1/2) * Sum_{u,v in Z} (u*u - 4*v*v) * x^(u*u + 4*v*v). - Michael Somos, Jun 14 2007
G.f.: eta(x)^6 = Sum_{n>=0} (1+2n)^2*x^(n^2+n) + 2*Sum_{n>=0,k>=1} (1 + 4(n^2+n-k^2))*x^(n^2+n+k^2) - from the Milne and Leininger reference. [Paul D. Hanna, Mar 15 2010]
a(0) = 1, a(n) = -(6/n)*Sum_{k=1..n} A000203(k)*a(n-k) for n > 0. - Seiichi Manyama, Mar 26 2017
G.f.: exp(-6*Sum_{k>=1} x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Feb 05 2018
Let M be a positive integer whose prime factors are all congruent to 3 (mod 4) - see A004614. Then a( M^2*n + (M^2 - 1)/4 ) = M^2*a(n). See Cooper et al., equation 5. - Peter Bala, Dec 01 2020
a(n) = b(4*n + 1) where b(n) is multiplicative with b(2^e) = 0^e, b(p^e) = p^e * (1 + (-1)^e) / 2 if p == 3 (mod 4), b(p^e) = ((x+y*i)^(2*e+2) - (x-y*i)^(2*e+2))/((x+y*i)^2 - (x-y*i)^2) if p == 1 (mod 4) where p = x^2 + y^2 and x is odd. - Jianing Song, Mar 19 2022

cp's OEIS Frontend

A053692 Number of self-conjugate 4-core partitions of n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

PARI

PARI

Formula

A008439 Expansion of Jacobi theta constant theta_2^5 /32.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A008440 Expansion of Jacobi theta constant theta_2^6 /(64q^(3/2)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

PARI

PARI

Formula

A002171 Glaisher's chi numbers. a(n) = chi(4*n + 1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Magma

Magma

Mathematica

PARI

PARI

PARI

Formula

A112610 Number of representations of n as a sum of two squares and two triangular numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A226252 Number of ways of writing n as the sum of 7 triangular numbers.

Views

Author

Keywords

Links