A284900 -id:A284900 - cp's OEIS frontend

A248882 Expansion of Product_{k>=1} (1+x^k)^(k^3).

1, 1, 8, 35, 119, 433, 1476, 4962, 16128, 51367, 160105, 490219, 1476420, 4378430, 12805008, 36962779, 105417214, 297265597, 829429279, 2291305897, 6270497702, 17008094490, 45744921052, 122052000601, 323166712109, 849453194355, 2217289285055, 5749149331789

Offset: 0

Vaclav Kotesovec, Mar 05 2015

nonn

Seiichi Manyama, Table of n, a(n) for n = 0..5510 (terms 0..1000 from Vaclav Kotesovec)
Vaclav Kotesovec, A method of finding the asymptotics of q-series based on the convolution of generating functions, arXiv:1509.08708 [math.CO], Sep 30 2015, p. 22.

Cf. A023872, A026007, A027998, A248883, A248884, A309335.

Column k=3 of A284992.

m:=50; R:=PowerSeriesRing(Rationals(), m); Coefficients(R! ( (&*[(1+x^k)^k^3: k in [1..m]]) )); // G. C. Greubel, Oct 31 2018

b:= proc(n) option remember; add(
      (-1)^(n/d+1)*d^4, d=numtheory[divisors](n))
    end:
a:= proc(n) option remember; `if`(n=0, 1,
      add(b(k)*a(n-k), k=1..n)/n)
    end:
seq(a(n), n=0..35);  # Alois P. Heinz, Oct 16 2017

nmax=50; CoefficientList[Series[Product[(1+x^k)^(k^3),{k,1,nmax}],{x,0,nmax}],x]

x = 'x + O('x^50); Vec(prod(k=1, 50, (1 + x^k)^(k^3))) \\ Indranil Ghosh, Apr 06 2017

a(n) ~ Zeta(5)^(1/10) * 3^(1/5) * exp(2^(-11/5) * 3^(2/5) * 5^(6/5) * Zeta(5)^(1/5) * n^(4/5)) / (2^(71/120) * 5^(2/5)* sqrt(Pi) * n^(3/5)), where Zeta(5) = A013663.
a(0) = 1, a(n) = (1/n)*Sum_{k=1..n} A284900(k)*a(n-k) for n > 0. - Seiichi Manyama, Apr 06 2017
G.f.: exp(Sum_{k>=1} (-1)^(k+1)*x^k*(1 + 4*x^k + x^(2*k))/(k*(1 - x^k)^4)). - Ilya Gutkovskiy, May 30 2018
Euler transform of A309335. - Georg Fischer, Nov 10 2020

A078306 a(n) = Sum_{d divides n} (-1)^(n/d+1)*d^2.

Original entry on oeis.org

1, 3, 10, 11, 26, 30, 50, 43, 91, 78, 122, 110, 170, 150, 260, 171, 290, 273, 362, 286, 500, 366, 530, 430, 651, 510, 820, 550, 842, 780, 962, 683, 1220, 870, 1300, 1001, 1370, 1086, 1700, 1118, 1682, 1500, 1850, 1342, 2366, 1590, 2210, 1710, 2451, 1953

Offset: 1

Vladeta Jovovic, Nov 22 2002

Seiichi Manyama, Table of n, a(n) for n = 1..10000
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. 4 and p. 8).
Heekyoung Hahn, Convolution sums of some functions on divisors, arXiv:1507.04426 [math.NT], 2015.
Index entries for sequences mentioned by Glaisher

Cf. A000593, A064027, A026007, A001157.

Glaisher's zeta'_i (i=0..12): A048272, A000593, A078306, A078307, A284900, A284926, A284927, A321552, A321553, A321554, A321555, A321556, A321557

a[n_] := Sum[(-1)^(n/d+1)*d^2, {d, Divisors[n]}]; Array[a, 50] (* Jean-François Alcover, Apr 17 2014 *)
Table[CoefficientList[Series[-Log[Product[1/(x^k + 1)^k, {k, 1, 90}]], {x, 0, 80}], x][[n + 1]] n, {n, 1, 80}] (* Benedict W. J. Irwin, Jul 05 2016 *)

a(n) = sumdiv(n, d, (-1)^(n/d+1)*d^2); \\ Michel Marcus, Jul 06 2016

from sympy import divisors
print([sum((-1)**(n//d + 1)*d**2 for d in divisors(n)) for n in range(1, 51)]) # Indranil Ghosh, Apr 05 2017

G.f.: Sum_{n >= 1} n^2*x^n/(1+x^n).
Multiplicative with a(2^e) = (2*4^e+1)/3, a(p^e) = (p^(2*e+2)-1)/(p^2-1), p > 2.
L.g.f.: -log(Product_{ k>0 } 1/(x^k+1)^k) = Sum_{ n>0 } (a(n)/n)*x^n. - Benedict W. J. Irwin, Jul 05 2016
G.f.: Sum_{n >= 1} (-1)^(n+1) * x^n*(1 + x^n)/(1 - x^n)^3. - Peter Bala, Jan 14 2021
From Vaclav Kotesovec, Aug 07 2022: (Start)
Dirichlet g.f.: zeta(s) * zeta(s-2) * (1 - 2^(1-s)).
Sum_{k=1..n} a(k) ~ zeta(3) * n^3 / 4. (End)

A284926 a(n) = Sum_{d|n} (-1)^(n/d+1)*d^5.

Original entry on oeis.org

1, 31, 244, 991, 3126, 7564, 16808, 31711, 59293, 96906, 161052, 241804, 371294, 521048, 762744, 1014751, 1419858, 1838083, 2476100, 3097866, 4101152, 4992612, 6436344, 7737484, 9768751, 11510114, 14408200, 16656728, 20511150, 23645064, 28629152, 32472031, 39296688

Offset: 1

Seiichi Manyama, Apr 06 2017

Multiplicative because this sequence is the Dirichlet convolution of A000584 and A062157 which are both multiplicative. - Andrew Howroyd, Jul 20 2018

Seiichi Manyama, Table of n, a(n) for n = 1..10000
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. 4 and p. 8).
Index entries for sequences mentioned by Glaisher.

Sum_{d|n} (-1)^(n/d+1)*d^k: A000593 (k=1), A078306 (k=2), A078307 (k=3), A284900 (k=4), this sequence (k=5), A284927 (k=6), A321552 (k=7), A321553 (k=8), A321554 (k=9), A321555 (k=10), A321556 (k=11), A321557 (k=12).

Cf. A000584, A013664, A062157.

Table[Sum[(-1)^(n/d + 1)*d^5, {d, Divisors[n]}], {n, 50}] (* Indranil Ghosh, Apr 06 2017 *)
f[p_, e_] := (p^(5*e + 5) - 1)/(p^5 - 1); f[2, e_] := (15*2^(5*e + 1) + 1)/31; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 50] (* Amiram Eldar, Nov 11 2022 *)

a(n) = sumdiv(n, d, (-1)^(n/d + 1)*d^5); \\ Indranil Ghosh, Apr 06 2017

from sympy import divisors
print([sum((-1)**(n//d + 1)*d**5 for d in divisors(n)) for n in range(1, 51)]) # Indranil Ghosh, Apr 06 2017

G.f.: Sum_{k>=1} k^5*x^k/(1 + x^k). - Ilya Gutkovskiy, Apr 07 2017
From Amiram Eldar, Nov 11 2022: (Start)
Multiplicative with a(2^e) = (15*2^(5*e+1)+1)/31, and a(p^e) = (p^(5*e+5) - 1)/(p^5 - 1) if p > 2.
Sum_{k=1..n} a(k) ~ c * n^6, where c = 31*zeta(6)/192 = 0.164258... . (End)

Keyword:mult added by Andrew Howroyd, Jul 23 2018

A284927 a(n) = Sum_{d|n} (-1)^(n/d+1)*d^6.

Original entry on oeis.org

1, 63, 730, 4031, 15626, 45990, 117650, 257983, 532171, 984438, 1771562, 2942630, 4826810, 7411950, 11406980, 16510911, 24137570, 33526773, 47045882, 62988406, 85884500, 111608406, 148035890, 188327590, 244156251, 304089030, 387952660, 474247150, 594823322

Offset: 1

Seiichi Manyama, Apr 06 2017

Multiplicative because this sequence is the Dirichlet convolution of A001014 and A062157 which are both multiplicative. - Andrew Howroyd, Jul 20 2018

Seiichi Manyama, Table of n, a(n) for n = 1..10000
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. 4 and p. 8).
Index entries for sequences mentioned by Glaisher.

Sum_{d|n} (-1)^(n/d+1)*d^k: A000593 (k=1), A078306 (k=2), A078307 (k=3), A284900 (k=4), A284926 (k=5), this sequence (k=6), A321552 (k=7), A321553 (k=8), A321554 (k=9), A321555 (k=10), A321556 (k=11), A321557 (k=12).

Cf. A001014, A013665, A062157.

Table[Sum[(-1)^(n/d + 1)*d^6, {d, Divisors[n]}], {n, 50}] (* Indranil Ghosh, Apr 06 2017 *)
f[p_, e_] := (p^(6*e + 6) - 1)/(p^6 - 1); f[2, e_] := (31*2^(6*e + 1) + 1)/63; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 50] (* Amiram Eldar, Nov 11 2022 *)

a(n) = sumdiv(n, d, (-1)^(n/d + 1)*d^6); \\ Indranil Ghosh, Apr 06 2017

from sympy import divisors
print([sum([(-1)**(n//d + 1)*d**6 for d in divisors(n)]) for n in range(1, 51)]) # Indranil Ghosh, Apr 06 2017

G.f.: Sum_{k>=1} k^6*x^k/(1 + x^k). - Ilya Gutkovskiy, Apr 07 2017
From Amiram Eldar, Nov 11 2022: (Start)
Multiplicative with a(2^e) = (31*2^(6*e+1)+1)/63, and a(p^e) = (p^(6*e+6) - 1)/(p^6 - 1) if p > 2.
Sum_{k=1..n} a(k) ~ c * n^7, where c = 9*zeta(7)/64 = 0.141799... . (End)

Keyword:mult added by Andrew Howroyd, Jul 23 2018

A321552 a(n) = Sum_{d|n} (-1)^(n/d+1)*d^7.

Original entry on oeis.org

1, 127, 2188, 16255, 78126, 277876, 823544, 2080639, 4785157, 9922002, 19487172, 35565940, 62748518, 104590088, 170939688, 266321791, 410338674, 607714939, 893871740, 1269938130, 1801914272, 2474870844, 3404825448, 4552438132, 6103593751, 7969061786, 10465138360, 13386707720, 17249876310

Offset: 1

N. J. A. Sloane, Nov 23 2018

Seiichi Manyama, Table of n, a(n) for n = 1..10000
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. 4 and p. 8).
Index entries for sequences mentioned by Glaisher.

Sum_{k>=1} k^b*x^k/(1 + x^k): A000593 (b=1), A078306 (b=2), A078307 (b=3), A284900 (b=4), A284926 (b=5), A284927 (b=6), this sequence (b=7), A321553 (b=8), A321554 (b=9), A321555 (b=10), A321556 (b=11), A321557 (b=12).
Cf. A321543 - A321565, A321807 - A321836 for similar sequences.
Cf. A013666.

f[p_, e_] := (p^(7*e + 7) - 1)/(p^7 - 1); f[2, e_] := (63*2^(7*e + 1) + 1)/127; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 50] (* Amiram Eldar, Nov 11 2022 *)

apply( A321552(n)=sumdiv(n, d, (-1)^(n\d-1)*d^7), [1..30]) \\ M. F. Hasler, Nov 26 2018

G.f.: Sum_{k>=1} k^7*x^k/(1 + x^k). - Seiichi Manyama, Nov 23 2018
From Amiram Eldar, Nov 11 2022: (Start)
Multiplicative with a(2^e) = (63*2^(7*e+1)+1)/127, and a(p^e) = (p^(7*e+7) - 1)/(p^7 - 1) if p > 2.
Sum_{k=1..n} a(k) ~ c * n^8, where c = 127*zeta(8)/1024 = 0.124529... . (End)

A284897 Expansion of Product_{k>=1} 1/(1+x^k)^(k^3) in powers of x.

Original entry on oeis.org

1, -1, -7, -20, -8, 99, 455, 958, 715, -3606, -17450, -44157, -61852, 19546, 419786, 1442212, 3084950, 3756436, -2155907, -27112107, -88277693, -187777531, -251308697, -5153980, 1182558343, 4299818445, 9988792754, 16075200671, 12020651310, -29802956283

Offset: 0

Seiichi Manyama, Apr 05 2017

sign

Seiichi Manyama, Table of n, a(n) for n = 0..7180

Cf. A248882.

Product_{k>=1} 1/(1+x^k)^(k^m): A081362 (m=0), A255528 (m=1), A284896 (m=2), this sequence (m=3), A284898 (m=4), A284899 (m=5).

CoefficientList[Series[Product[1/(1 + x^k)^(k^3) , {k, 40}], {x, 0, 40}], x] (* Indranil Ghosh, Apr 05 2017 *)

x= 'x + O('x^40); Vec(prod(k=1, 40, 1/(1 + x^k)^(k^3))) \\ Indranil Ghosh, Apr 05 2017

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

A322081 Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} (-1)^(n/d+1)*d^k.

Original entry on oeis.org

1, 1, 0, 1, 1, 2, 1, 3, 4, -1, 1, 7, 10, 1, 2, 1, 15, 28, 11, 6, 0, 1, 31, 82, 55, 26, 4, 2, 1, 63, 244, 239, 126, 30, 8, -2, 1, 127, 730, 991, 626, 196, 50, 1, 3, 1, 255, 2188, 4031, 3126, 1230, 344, 43, 13, 0, 1, 511, 6562, 16255, 15626, 7564, 2402, 439, 91, 6, 2, 1, 1023, 19684, 65279, 78126, 45990, 16808, 3823, 757, 78, 12, -2

Offset: 1

Ilya Gutkovskiy, Nov 26 2018

			Square array begins:
   1,  1,   1,    1,     1,     1,  ...
   0,  1,   3,    7,    15,    31,  ...
   2,  4,  10,   28,    82,   244,  ...
  -1,  1,  11,   55,   239,   991,  ...
   2,  6,  26,  126,   626,  3126,  ...
   0,  4,  30,  196,  1230,  7564,  ...

Andrew Howroyd, Table of n, a(n) for n = 1..1275 (first 50 antidiagonals)
Index entries for sequences mentioned by Glaisher

Columns k=0..12 give A048272, A000593, A078306, A078307, A284900, A284926, A284927, A321552, A321553, A321554, A321555, A321556, A321557.

Cf. A109974, A279394, A279396, A285425, A321438 (diagonal), A322082, A322083, A322084.

Table[Function[k, Sum[(-1)^(n/d + 1) d^k, {d, Divisors[n]}]][i - n], {i, 0, 12}, {n, 1, i}] // Flatten
Table[Function[k, SeriesCoefficient[Sum[j^k x^j/(1 + x^j), {j, 1, n}], {x, 0, n}]][i - n], {i, 0, 12}, {n, 1, i}] // Flatten

T(n,k)={sumdiv(n, d, (-1)^(n/d+1)*d^k)}
for(n=1, 10, for(k=0, 8, print1(T(n, k), ", ")); print); \\ Andrew Howroyd, Nov 26 2018

G.f. of column k: Sum_{j>=1} j^k*x^j/(1 + x^j).

A321438 a(n) = Sum_{d|n} (-1)^(n/d+1)*d^n.

Original entry on oeis.org

1, 3, 28, 239, 3126, 45990, 823544, 16711423, 387440173, 9990235398, 285311670612, 8913939907598, 302875106592254, 11111328602501550, 437893920912786408, 18446462594437808127, 827240261886336764178, 39346258082220810086373, 1978419655660313589123980, 104857499999905732078938574

Offset: 1

Ilya Gutkovskiy, Nov 09 2018

nonn

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

Cf. A000593, A023887, A078306, A078307, A186633, A284900, A284926, A284927, A321385.

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

Table[Sum[(-1)^(n/d + 1) d^n, {d, Divisors[n]}], {n, 20}]
nmax = 20; Rest[CoefficientList[Series[Sum[(k x)^k/(1 + (k x)^k), {k, 1, nmax}], {x, 0, nmax}], x]]
nmax = 20; Rest[CoefficientList[Series[Log[Product[(1 + k^k x^k)^(1/k), {k, 1, nmax}]], {x, 0, nmax}], x] Range[0, nmax]]

a(n) = sumdiv(n, d, (-1)^(n/d+1)*d^n); \\ Michel Marcus, Nov 09 2018

G.f.: Sum_{k>=1} (k*x)^k/(1 + (k*x)^k).
L.g.f.: log(Product_{k>=1} (1 + k^k*x^k)^(1/k)) = Sum_{n>=1} a(n)*x^n/n.
a(n) ~ n^n. - Vaclav Kotesovec, Nov 10 2018

A309338 a(n) = n^4 if n odd, 7*n^4/8 if n even.

Original entry on oeis.org

0, 1, 14, 81, 224, 625, 1134, 2401, 3584, 6561, 8750, 14641, 18144, 28561, 33614, 50625, 57344, 83521, 91854, 130321, 140000, 194481, 204974, 279841, 290304, 390625, 399854, 531441, 537824, 707281, 708750, 923521, 917504, 1185921, 1169294, 1500625, 1469664, 1874161, 1824494

Offset: 0

Ilya Gutkovskiy, Jul 24 2019

Moebius transform of A284900.

Amiram Eldar, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (0,5,0,-10,0,10,0,-5,0,1).

Cf. A000583, A016756, A059377, A129194, A193356, A284900, A309337.

a[n_] := If[OddQ[n], n^4, 7 n^4/8]; Table[a[n], {n, 0, 38}]
nmax = 38; CoefficientList[Series[x (1 + 14 x + 76 x^2 + 154 x^3 + 230 x^4 + 154 x^5 + 76 x^6 + 14 x^7 + x^8)/(1 - x^2)^5, {x, 0, nmax}], x]
LinearRecurrence[{0, 5, 0, -10, 0, 10, 0, -5, 0, 1}, {0, 1, 14, 81, 224, 625, 1134, 2401, 3584, 6561}, 39]
Table[n^4 (15 - (-1)^n)/16, {n, 0, 38}]

G.f.: x * (1 + 14*x + 76*x^2 + 154*x^3 + 230*x^4 + 154*x^5 + 76*x^6 + 14*x^7 + x^8)/(1 - x^2)^5.
G.f.: Sum_{k>=1} J_4(k) * x^k/(1 + x^k), where J_4() is the Jordan function (A059377).
Dirichlet g.f.: zeta(s-4) * (1 - 2^(1-s)).
a(n) = n^4 * (15 - (-1)^n)/16.
a(n) = Sum_{d|n} (-1)^(n/d + 1) * J_4(d).
Sum_{n>=1} 1/a(n) = 113*Pi^4/10080 = 1.091986834012130496797...
Multiplicative with a(2^e) = 7*2^(4*e-3), and a(p^e) = p^(4*e) for odd primes p. - Amiram Eldar, Oct 26 2020

A386729 a(n) = [x^n] G(x)^n, where G(x) = Product_{k >= 1} (1 + x^k)^(k^3) is the g.f. of A248882.

Original entry on oeis.org

1, 1, 17, 154, 1377, 13276, 127862, 1249746, 12321121, 122287798, 1220492192, 12235940113, 123133325382, 1243080020352, 12583773308102, 127688996851804, 1298370095026017, 13226355435367992, 134955405683954234, 1379032238329708409, 14110075394718902752, 144544237021110644340

Offset: 0

Vaclav Kotesovec, Jul 31 2025

nonn

Vaclav Kotesovec, Table of n, a(n) for n = 0..975

Cf. A248882, A284900, A386720.

Cf. A270913, A270922, A380291.

Table[SeriesCoefficient[Product[(1+x^k)^(n*k^3), {k, 1, n}], {x, 0, n}], {n, 0, 25}]
Table[SeriesCoefficient[Exp[n*Sum[Sum[(-1)^(k/d + 1)*d^4, {d, Divisors[k]}]*x^k/k, {k, 1, n}]], {x, 0, n}], {n, 0, 25}]

a(n) = [x^n] exp(n*Sum_{k >= 1} s_4(k)*x^k/k), where s_4(n) = Sum_{d divides n} (-1)^(n/d+1)*d^4 = A284900(n).

a(n) ~ c * d^n / sqrt(n), where d = 10.49088673566991578441632677715184699104285539252671173854512548234581416... and c = 0.2449508761900081824436717230940007974244164508939377916825513986093942...

cp's OEIS Frontend

A248882 Expansion of Product_{k>=1} (1+x^k)^(k^3).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A078306 a(n) = Sum_{d divides n} (-1)^(n/d+1)*d^2.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A284926 a(n) = Sum_{d|n} (-1)^(n/d+1)*d^5.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A284927 a(n) = Sum_{d|n} (-1)^(n/d+1)*d^6.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A321552 a(n) = Sum_{d|n} (-1)^(n/d+1)*d^7.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A284897 Expansion of Product_{k>=1} 1/(1+x^k)^(k^3) in powers of x.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A322081 Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} (-1)^(n/d+1)*d^k.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI