A321552 -id:A321552 - cp's OEIS frontend

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

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, 2900, -3230, 2810, -2460, 3172

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.

Apart from signs, same as A064027.
Glaisher's zeta_i, i=0..12: A048272, A002129, A321543, A138503, A279395, A321544, A321545, A321546, A321547, A321548, A321549, A321550, A321551.
Cf. A321552 - A321565, A321807 - A321836 for similar sequences.

with(numtheory):
a := n -> add( (-1)^(d-1)*d^2, d in divisors(n) ): seq(a(n), n = 1..40);
#  Peter Bala, Jan 11 2021

f[p_, e_] := (p^(2*e + 2) - 1)/(p^2 - 1); f[2, e_] := 2 - (2^(2*e + 2) - 1)/3; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 55] (* Amiram Eldar, Nov 04 2022 *)

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

G.f.: Sum_{k>=1} (-1)^(k-1)*k^2*x^k/(1 - x^k). - Ilya Gutkovskiy, Dec 23 2018
G.f.: Sum_{n >= 1} x^n*(1 - x^n)/(1 + x^n)^3. - Peter Bala, Jan 11 2021
Multiplicative with a(2^e) = 2 - (2^(2*e + 2) - 1)/3, and a(p^e) = (p^(2*e + 2) - 1)/(p^2 - 1) for p > 2. - Amiram Eldar, Nov 04 2022

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)

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

Original entry on oeis.org

1, 15, 82, 239, 626, 1230, 2402, 3823, 6643, 9390, 14642, 19598, 28562, 36030, 51332, 61167, 83522, 99645, 130322, 149614, 196964, 219630, 279842, 313486, 391251, 428430, 538084, 574078, 707282, 769980, 923522, 978671, 1200644, 1252830, 1503652, 1587677

Offset: 1

Seiichi Manyama, Apr 05 2017

Multiplicative because this sequence is the Dirichlet convolution of A000583 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), this sequence (k=4), A284926 (k=5), A284927 (k=6), A321552 (k=7), A321553 (k=8), A321554 (k=9), A321555 (k=10), A321556 (k=11), A321557 (k=12).

Cf. A000583, A013663, A062157, A386729.

Table[Sum[(-1)^(n/d + 1)*d^4, {d, Divisors[n]}], {n, 50}] (* Indranil Ghosh, Apr 05 2017 *)
f[p_, e_] := (p^(4*e + 4) - 1)/(p^4 - 1); f[2, e_] := (7*2^(4*e + 1) + 1)/15; 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^4); \\ Indranil Ghosh, Apr 05 2017

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

G.f.: Sum_{k>=1} k^4*x^k/(1 + x^k). - Ilya Gutkovskiy, Apr 07 2017
From Amiram Eldar, Nov 11 2022: (Start)
Multiplicative with a(2^e) = (7*2^(4*e+1)+1)/15, and a(p^e) = (p^(4*e+4) - 1)/(p^4 - 1) if p > 2.
Sum_{k=1..n} a(k) ~ c * n^5, where c = 3*zeta(5)/16 = 0.194423... . (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

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).

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

Original entry on oeis.org

1, -31, 244, -1055, 3126, -7564, 16808, -33823, 59293, -96906, 161052, -257420, 371294, -521048, 762744, -1082399, 1419858, -1838083, 2476100, -3297930, 4101152, -4992612, 6436344, -8252812, 9768751, -11510114, 14408200, -17732440, 20511150, -23645064, 28629152, -34636831, 39296688, -44015598

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.

Divisor sums Sum_{d|n} (-1)^(d-1)*d^k: A048272 (k = 0), A002129 (k = 1), A321543 (k = 2), A138503 (k = 3), A279395 (k = 4, unsigned), A321545 - A321551 (k = 6 to k = 12).

Cf. A321552 - A321565, A321807 - A321836 for similar sequences.

with(numtheory):
a := n -> add( (-1)^(d-1)*d^5, d in divisors(n) ): seq(a(n), n = 1..40);
#  Peter Bala, Jan 11 2021

f[p_, e_] := (p^(5*e + 5) - 1)/(p^5 - 1); f[2, e_] := 2 - (2^(5*e + 5) - 1)/31; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 35] (* Amiram Eldar, Nov 04 2022 *)

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

G.f.: Sum_{k>=1} (-1)^(k-1)*k^5*x^k/(1 - x^k). - Ilya Gutkovskiy, Dec 23 2018
G.f.: Sum_{n >= 1} x^n*(x^(4*n) - 26*x^(3*n) + 66*x^(2*n) - 26*x^n + 1)/(1 + x^n)^6 (note [1,26,66,26,1] is row 5 of A008292). - Peter Bala, Jan 11 2021
Multiplicative with a(2^e) = 2 - (2^(5*e + 5) - 1)/31, and a(p^e) = (p^(5*e + 5) - 1)/(p^5 - 1) for p > 2. - Amiram Eldar, Nov 04 2022

cp's OEIS Frontend

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

Views

Author

Keywords

Links

Crossrefs

Programs

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

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

Views

Author

Keywords

Comments

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

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

Formula

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

Views

Author

Keywords

Links

Crossrefs

Programs

Maple