A002129 -id:A002129 - cp's OEIS frontend

A106507 G.f.: Product_{k>0} (1-x^(2k-1))/(1-x^(2k)).

1, -1, 1, -2, 3, -4, 5, -7, 10, -13, 16, -21, 28, -35, 43, -55, 70, -86, 105, -130, 161, -196, 236, -287, 350, -420, 501, -602, 722, -858, 1016, -1206, 1431, -1687, 1981, -2331, 2741, -3206, 3740, -4368, 5096, -5922, 6868, -7967, 9233, -10670, 12306, -14193

Offset: 0

Michael Somos, May 04 2005

Ramanujan theta functions: f(q) (see A121373), phi(q) (A000122), psi(q) (A010054), chi(q) (A000700). The present entry gives 1/psi(q).

For various G.f. versions see the reciprocals of the ones given in A010054. - Wolfdieter Lang, Jul 05 2016

			G.f. = 1 - x + x^2 - 2*x^3 + 3*x^4 - 4*x^5 + 5*x^6 - 7*x^7 + 10*x^8 + ...
G.f. of B(q) =  A(q^8) / q = 1/q - q^7 + q^15 - 2*q^23 + 3*q^31 - 4*q^39 + 5*q^47 - 7*q^55 + ...

Srinivasa Ramanujan, The Lost Notebook and Other Unpublished Papers, Narosa Publishing House, New Delhi, 1988, p. 3, 3rd equation, p. 41, 12th equation.

Seiichi Manyama, Table of n, a(n) for n = 0..10000
C. Adiga, N. Anitha, T. Kim, Transformations of Ramanujan's Summation Formula and its Applications, arXiv:math/0501528 [math.NT], 2005. See page 5.
Michael Somos, Introduction to Ramanujan theta functions
Eric Weisstein's World of Mathematics, Ramanujan Theta Functions, q-Pochhammer Symbol

Cf. A006950, A010054, A106336, A233758, A233759.

nmax=40; CoefficientList[Series[Product[1/(1-x^k)^((-1)^k),{k,1,nmax}],{x,0,nmax}],x] (* Vaclav Kotesovec, May 28 2015 *)
a[ n_] := SeriesCoefficient[ 2 x^(1/8) / EllipticTheta[ 2, 0, x^(1/2)] , {x, 0, n}]; (* Michael Somos, Jun 25 2015 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ x, x^2] / QPochhammer[ x^2], {x, 0, n}]; (* Michael Somos, Nov 08 2015 *)
a[ n_] := SeriesCoefficient[ QPochhammer[ x, -x] / QPochhammer[ x^4], {x, 0, n}]; (* Michael Somos, Nov 08 2015 *)
(QPochhammer[x, x^2, 1/2] + O[x]^50)[[3]] (* Vladimir Reshetnikov, Nov 20 2016 *)

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

Expansion of 1 / psi(x) in powers of x where psi() is a Ramanujan theta function, which is Jacobi's theta_2(0, sqrt(x))/(2*x^(1/8)) function. See, e.g., the Eric Weisstein link.
Expansion of q^(1/8) * eta(q) / eta(q^2)^2 in powers of q.
Euler transform of period 2 sequence [ -1, 1, ...].
Given g.f. A(x), then B(q) = A(q^8) / q satisfies 0 = f(B(q), B(q^2), B(q^4)) where f(u, v, w) = u^4 * (w^4 + 4*v^4) - v^6*w^2.
Given g.f. A(x), then B(q) = A(q^8) / q satisfies 0 = f(B(q), B(q^2), B(q^3), B(q^6)) where f(u1, u2, u3, u6) = u1*u2*u6^3 + u2^2*u3^3 - u3^3*u6^2.
Given g.f. A(x), then B(q) = A(q^8) / q satisfies 0 = f(B(q), B(q^2), B(q^3), B(q^6)) where f(u1, u2, u3, u6) = u1^3*u6^2 + 3*u1^3*u2^2 - u2^3*u3*u6.
G.f.: Sum_{k>=0} a(k) * x^(8*k - 1) = 1 / (Sum_{k in Z} x^((4k + 1)^2)).
G.f.: 1 / (1 + x + x^3 + x^6 + ...) = 1 - x * (1 - x) / (1 - x^2)^2 + x^4 * (1 - x) * (1 - x^2) / ((1 - x^2)^2 * (1 - x^4)^2) + ... [Ramanujan]  - Michael Somos, Jul 21 2008
G.f. is a period 1 Fourier series which satisfies f(-1 / (16 t)) = 2^(1/2) (t/i)^(-1/2) g(t) where q = exp(2 Pi i t) and g() is the g.f. for A015128. - Michael Somos, Nov 01 2008
a(n) = (-1)^n * A006950(n). Convolution inverse of A010054.
Series reversion of A106336. - Michael Somos, May 10 2012
a(2*n) = A233758(n). a(2*n + 1) = - A233759(n). - Michael Somos, Nov 05 2015
G.f.: Product_{k>0} (1 - x^(2*k - 1)) / (1 - x^(2*k)). - Michael Somos, Nov 08 2015
G.f.: (x; x^2){1/2}, where (a; q)_n is the q-Pochhammer symbol. - _Vladimir Reshetnikov, Nov 20 2016
a(0) = 1, a(n) = -(1/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, Apr 08 2017

Definition changed by N. J. A. Sloane, Aug 14 2007

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

A014787 Expansion of Jacobi theta constant (theta_2/2)^12.

Original entry on oeis.org

1, 12, 66, 232, 627, 1452, 2982, 5544, 9669, 16016, 25158, 38160, 56266, 80124, 111816, 153528, 205260, 270876, 353870, 452496, 574299, 724044, 895884, 1103520, 1353330, 1633500, 1966482, 2360072, 2792703, 3299340, 3892922, 4533936, 5273841, 6134448

Offset: 0

N. J. A. Sloane

nonn

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

			a(2) = (A001160(7) - A000735(3))/256 = (16808 - (-88))/256 = 66. - _Wolfdieter Lang_, Jan 13 2017

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=12, Theorem 7.

Column k=12 of A286180.
Cf. A000217, A000735, A001160.
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.

From Wolfdieter Lang, Jan 13 2017: (Start)
G.f.: 12th power of g.f. for A010054.
a(n) = (A001160(2*n+3) - A000735(n+1))/256. See the Ono et al. link, case k=12, Theorem 7. (End)
a(0) = 1, a(n) = (12/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, May 06 2017
G.f.: exp(Sum_{k>=1} 12*(x^k/k)/(1 + x^k)). - Ilya Gutkovskiy, Jul 31 2017

More terms from Seiichi Manyama, May 05 2017

A014809 Expansion of Jacobi theta constant (theta_2/2)^24.

Original entry on oeis.org

1, 24, 276, 2048, 11178, 48576, 177400, 565248, 1612875, 4200352, 10131156, 22892544, 48897678, 99448320, 193740408, 363315200, 658523925, 1157743824, 1980143600, 3303168000, 5386270686, 8602175744, 13477895856, 20748607488, 31425764410, 46883528256, 68969957700

Offset: 0

N. J. A. Sloane

nonn

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

Seiichi Manyama, Table of n, a(n) for n = 0..10000
James G. Huard and Kenneth S. Williams, Sums of sixteen and twenty-four triangular numbers, Rocky Mountain J. Math. Volume 35, Number 3 (2005), 857-868.
Ken Ono, Sinai Robins and Patrick 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=24, Theorem 8; alternative link.

Column k=24 of A286180.
Cf. A000217, A000594, A096963.
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.

a[n_] := Module[{e = IntegerExponent[n+3, 2]}, (2^(11*e) * DivisorSigma[11, (n+3)/2^e] - RamanujanTau[n+3] - 2072 * If[OddQ[n], RamanujanTau[(n+3)/2], 0]) / 176896]; Array[a, 27, 0] (* Amiram Eldar, Jan 11 2025 *)

From Wolfdieter Lang, Jan 13 2017: (Start)
G.f.: 24th power of the g.f. for A010054.
a(n) = (A096963(n+3) - tau(n+3) - 2072*tau((n+3)/2))/176896, with Ramanujan's tau function given in A000594, and tau(n) is put to 0 if n is not integer. See the Ono et al. link, case k=24, Theorem 8. (End)
a(n) = 1/72 * Sum_{a, b, x, y > 0, a*x + b*y = n + 3, x == y == 1 mod 2 and a > b} (a*b)^3*(a^2 - b^2)^2. - Seiichi Manyama, May 05 2017
a(0) = 1, a(n) = (24/n)*Sum_{k=1..n} A002129(k)*a(n-k) for n > 0. - Seiichi Manyama, May 06 2017
G.f.: exp(Sum_{k>=1} 24*(x^k/k)/(1 + x^k)). - Ilya Gutkovskiy, Jul 31 2017

More terms from Seiichi Manyama, May 05 2017

A226255 Number of ways of writing n as the sum of 11 triangular numbers.

Original entry on oeis.org

1, 11, 55, 176, 440, 957, 1848, 3245, 5412, 8580, 12892, 18888, 26895, 36916, 50160, 66935, 86658, 111870, 142582, 177320, 221100, 272690, 329065, 399102, 480040, 566808, 672969, 793760, 920326, 1074040, 1248412, 1425974, 1640595, 1882145, 2123385, 2418339, 2743928, 3062895, 3453978, 3880855

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

A008457 a(n) = Sum_{ d >= 1, d divides n} (-1)^(n-d)*d^3.

Original entry on oeis.org

1, 7, 28, 71, 126, 196, 344, 583, 757, 882, 1332, 1988, 2198, 2408, 3528, 4679, 4914, 5299, 6860, 8946, 9632, 9324, 12168, 16324, 15751, 15386, 20440, 24424, 24390, 24696, 29792, 37447, 37296, 34398, 43344, 53747, 50654, 48020, 61544, 73458

Offset: 1

N. J. A. Sloane

The modular form (e(1)-e(2))(e(1)-e(3)) for GAMMA_0 (2) (with constant term -1/16 omitted).

a(n) = r_8(n)/16, where r_8(n) = A000143(n) is the number of integral solutions of Sum_{j=1..8} x_j^2 = n (with the order of the summands respected). See the Grosswald reference, and the Hardy reference, pp. 146-147, eq. (9.9.3) and sect. 9.10. - Wolfdieter Lang, Jan 09 2017

			G.f. = q + 7*q^2 + 28*q^3 + 71*q^4 + 126*q^5 + 196*q^6 + 344*q^7 + 583*q^8 + ...

Nathan J. Fine, Basic Hypergeometric Series and Applications, Amer. Math. Soc., 1988; p. 77, Eq. (31.6).
Emil Grosswald, Representations of Integers as Sums of Squares. Springer-Verlag, NY, 1985, p. 121, eq. (9.19).
G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, AMS Chelsea Publishing, Providence, Rhode Island, 2002, p. 142.
F. Hirzebruch, T. Berger and R. Jung, Manifolds and Modular Forms, Vieweg, 1994, pp. 77, 133.
Hans Petersson, Modulfunktionen und Quadratische Formen, Springer-Verlag, 1982; p. 179.

G. C. Greubel, Table of n, a(n) for n = 1..5000
Meinhard Peters, Sums of nine squares, Acta Arith., Vol. 102 (2002), pp. 131-135.

Cf. A000143, A001158, A051000, A064027, A002129, A048272, A138503.

(1/16)*product((1+q^n)^8/(1-q^n)^8,n=1..60);

nmax = 40; Rest[CoefficientList[Series[Product[((1-(-q)^k)/(1+(-q)^k))^8, {k, 1, nmax}]/16, {q, 0, nmax}], q]] (* Vaclav Kotesovec, Sep 26 2015 *)
a[n_] := DivisorSum[n, (-1)^(n-#)*#^3&]; Array[a, 40] (* Jean-François Alcover, Dec 01 2015 *)
a[ n_] := SeriesCoefficient[ (EllipticTheta[ 3, 0, x]^8 - 1) / 16, {x, 0, n}]; (* Michael Somos, Aug 10 2018 *)
f[2, e_] := (8^(e+1)-15)/7; f[p_, e_] := (p^(3*e+3)-1)/(p^3-1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 21 2020 *)

{a(n) = if( n<1, 0, (-1)^n * sumdiv(n, d, (-1)^d * d^3))}; /* Michael Somos, Sep 25 2005 */

from math import prod
from sympy import factorint
def A008457(n): return prod((p**(3*(e+1))-(1 if p&1 else 15))//(p**3-1) for p, e in factorint(n).items()) # Chai Wah Wu, Jun 21 2024

Multiplicative with a(2^e) = (8^(e+1)-15)/7, a(p^e) = (p^(3*e+3)-1)/(p^3-1), p > 2. - Vladeta Jovovic, Sep 10 2001
a(n) = (-1)^n*(sum of cubes of even divisors of n - sum of cubes of odd divisors of n), see A051000. Sum_{n>0} n^3*x^n*(15*x^n-(-1)^n)/(1-x^(2*n)). - Vladeta Jovovic, Oct 24 2002
G.f.: Sum_{k>0} k^3 x^k/(1 - (-x)^k). - Michael Somos, Sep 25 2005
G.f.: (1/16)*(-1+(Product_{k>0} (1-(-q)^k)/(1+(-q)^k))^8). [corrected by Vaclav Kotesovec, Sep 26 2015]
Dirichlet g.f. zeta(s)*zeta(s-3)*(1-2^(1-s)+2^(4-2s)), Dirichlet convolution of A001158 and the quasi-finite (1,-2,0,16,0,0,...). - R. J. Mathar, Mar 04 2011
A138503(n) = -(-1)^n * a(n).
Bisection: a(2*k-1) = A001158(2*k-1), a(2*k) = 8*A001158(k) - A051000(k), k >= 1. In the Hardy reference a(n) = sigma^*3(n). - _Wolfdieter Lang, Jan 07 2017
G.f.: (theta_3(x)^8 - 1)/16, where theta_3() is the Jacobi theta function. - Ilya Gutkovskiy, Apr 17 2018
Sum_{k=1..n} a(k) ~ Pi^4 * n^4 / 384. - Vaclav Kotesovec, Sep 21 2020

A064027 a(n) = (-1)^nSum_{d|n} (-1)^dd^2.

Original entry on oeis.org

1, 3, 10, 19, 26, 30, 50, 83, 91, 78, 122, 190, 170, 150, 260, 339, 290, 273, 362, 494, 500, 366, 530, 830, 651, 510, 820, 950, 842, 780, 962, 1363, 1220, 870, 1300, 1729, 1370, 1086, 1700, 2158, 1682, 1500, 1850, 2318, 2366, 1590, 2210, 3390, 2451, 1953

Offset: 1

Vladeta Jovovic, Sep 11 2001

			L.g.f.: L(x) = x + 3*x^2/2 + 10*x^3/3 + 19*x^4/4 + 26*x^5/5 + 30*x^6/6 + ...
where exp(L(x)) = 1 + x + 2*x^2 + 5*x^3 + 10*x^4 + 18*x^5 + 32*x^6 + 59*x^7 + 106*x^8 + 181*x^9 + ... + A224364(n)*x^n + ... - _Paul D. Hanna_, Apr 04 2013

G. H. Hardy, Ramanujan: twelve lectures on subjects suggested by his life and work, AMS Chelsea Publishing, Providence, Rhode Island, 2002, p. 142.

Paul D. Hanna, Table of n, a(n) for n = 1..1000
Heekyoung Hahn, Convolution sums of some functions on divisors, arXiv:1507.04426 [math.NT], 2015.

Cf. A001157, A002129, A008457, A050999, A224364.

Cf. A321543 - A321565, A321807 - A321836 for related sequences.

m:=60; R:=PowerSeriesRing(Integers(), m); Coefficients(R!( (&+[k^2*x^k/(1-(-x)^k): k in [1..m]]) )); // G. C. Greubel, Nov 09 2018

a[n_] := (-1)^n DivisorSum[n, (-1)^# * #^2 &]; Array[a, 50] (* Jean-François Alcover, Dec 23 2015 *)
a[n_] := If[OddQ[n], 1, (1 - 6/(4^(IntegerExponent[n, 2] + 1) - 1))] * DivisorSigma[2, n]; Array[a, 100] (* Amiram Eldar, Sep 21 2023 *)

{a(n)=if(n<1, 0, (-1)^n*sumdiv(n^1, d, (-1)^d*d^2))} \\ Paul D. Hanna, Apr 04 2013

Multiplicative with a(2^e) = (4^(e+1)-7)/3, a(p^e) = (p^(2*e+2)-1)/(p^2-1), p > 2.
a(n) = (-1)^n*(A001157(n) - 2*A050999(n)).
Logarithmic derivative of A224364. - Paul D. Hanna, Apr 04 2013
Bisection: a(2*k-1) = A001157(2*k-1), a(2*k) = 4*A001157(k) - A050999(2*k), k >= 1. In the Hardy reference a(n) = sigma^*2(n). - _Wolfdieter Lang, Jan 07 2017
G.f.: Sum_{k>=1} k^2*x^k/(1 - (-x)^k). - Ilya Gutkovskiy, Nov 09 2018
Sum_{k=1..n} a(k) ~ 7 * zeta(3) * n^3 / 24. - Vaclav Kotesovec, Nov 10 2018
Dirichlet g.f.: zeta(s) * zeta(s-2) * (1 - 1/2^(s-1) + 1/2^(2*s-3)). - Amiram Eldar, Sep 21 2023

A024919 a(n) = Sum_{k=1..n} (-1)^kkfloor(n/k).

Original entry on oeis.org

-1, 0, -4, 1, -5, -1, -9, 4, -9, -3, -15, 5, -9, -1, -25, 4, -14, -1, -21, 9, -23, -11, -35, 17, -14, 0, -40, 0, -30, -6, -38, 23, -25, -7, -55, 10, -28, -8, -64, 14, -28, 4, -40, 20, -58, -34, -82, 34, -23, 8, -64, 6, -48, -8, -80, 24, -56, -26, -86, 34, -28, 4, -100, 25, -59

Offset: 1

Clark Kimberling

sign

n - 2*[ n/2 ] + 3*[ n/3 ] - ... + m*n*[ n/n ], where m = (-1)^(n+1).

Seiichi Manyama, Table of n, a(n) for n = 1..10000

The zeros are A072663.
Partial sums of A002129.
Cf. A024916, A309124.

[&+[(-1)^k*k*(n div k): k in [1..n]]: n in [1..70]]; // Vincenzo Librandi, Jul 28 2019

f[n_] := Sum[(-1)^i*i*Floor[n/i], {i, 1, n}]; Table[ f[n], {n, 1, 85}]

a(n) = sum(k=1, n, (-1)^k*k*floor(n/k));

from math import isqrt
def A024919(n): return (-(s:=isqrt(m:=n>>1))**2*(s+1) + sum((q:=m//k)*((k<<1)+q+1) for k in range(1,s+1))<<1)+((s:=isqrt(n))**2*(s+1)-sum((q:=n//k)*((k<<1)+q+1) for k in range(1,s+1))>>1) # Chai Wah Wu, Oct 22 2023

a(n) = 4*A024916(floor(n/2)) - A024916(n). - Vladeta Jovovic, Oct 15 2002
G.f.: 1/(1-x) * Sum_{n>=1} n*x^n*(3*x^n-1)/(1-x^(2*n)). - Vladeta Jovovic, Oct 15 2002
G.f.: -1/(1-x) * Sum_{k>=1} x^k/(1+x^k)^2 = 1/(1-x) * Sum_{k>=1} k * (-x)^k/(1-x^k). - Seiichi Manyama, Oct 29 2023

Edited by Robert G. Wilson v, Aug 17 2002

A162552 L.g.f.: log( Sum_{n>=0} x^(n^2) ), the log of the characteristic function of the squares.

Original entry on oeis.org

1, -1, 1, 3, -4, 5, -6, 3, 10, -16, 23, -27, 14, 6, -34, 83, -101, 86, -37, -72, 204, -309, 346, -243, -29, 454, -908, 1214, -1130, 470, 776, -2413, 3884, -4421, 3244, 162, -5438, 11285, -15352, 14688, -6887, -8640, 29241, -48353, 56270, -42850, 1834

Offset: 1

Paul D. Hanna, Jul 06 2009

sign

			L.g.f.: L(x) = x - 1*x^2/2 + 1*x^3/3 + 3*x^4/4 - 4*x^5/5 + 5*x^6/6 -...
exp(L(x)) = 1 + x + x^4 + x^9 + x^16 + x^25 + x^36 +...+ x^(n^2) +...

Paul D. Hanna, Table of n, a(n), n = 1..650.

Cf. A162553, A002129, A010052.

{a(n)=local(Q=sum(m=0,sqrtint(n+1),x^(m^2))+x*O(x^n));n*polcoeff(log(Q),n)}

L.g.f.: L(x) = Sum_{n>=1} a(n)*x^n/n = log( Sum_{n>=0} x^(n^2) ).

cp's OEIS Frontend

A106507 G.f.: Product_{k>0} (1-x^(2k-1))/(1-x^(2k)).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

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

Views

Author

Keywords

Links

Crossrefs

Formula

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

Views

Author

Keywords

Links

Crossrefs

Formula

A014787 Expansion of Jacobi theta constant (theta_2/2)^12.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A014809 Expansion of Jacobi theta constant (theta_2/2)^24.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A226255 Number of ways of writing n as the sum of 11 triangular numbers.

Views

Author

Keywords

Links

Crossrefs

Formula

A008457 a(n) = Sum_{ d >= 1, d divides n} (-1)^(n-d)*d^3.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A064027 a(n) = (-1)^n*Sum_{d|n} (-1)^d*d^2.

Views

Author

Keywords

Examples

References

Links

Crossrefs

A064027 a(n) = (-1)^nSum_{d|n} (-1)^dd^2.

A024919 a(n) = Sum_{k=1..n} (-1)^kkfloor(n/k).