A051001 -id:A051001 - cp's OEIS frontend

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

1, 15, 82, 271, 626, 1230, 2402, 4367, 6643, 9390, 14642, 22222, 28562, 36030, 51332, 69903, 83522, 99645, 130322, 169646, 196964, 219630, 279842, 358094, 391251, 428430, 538084, 650942, 707282, 769980, 923522, 1118479, 1200644, 1252830, 1503652, 1800253, 1874162, 1954830, 2342084, 2733742

Offset: 1

Wolfdieter Lang, Jan 09 2017

This is the k=4 member of the family sigma^*_k(n), defined in the Hardy reference, which is sigma_k(2*j+1) if n = 2*j+1 and sigma_k^e(2*j) - sigma_k^o(2*j) if n=2*j, where the superscript e and o stands for a restriction to even and odd divisors in the sum of their k-th powers, respectively.

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

Amiram Eldar, 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

Cf. A112329 (k=0), A113184 (k=1), A064027 (k=2), A008457(k=3).

[&+[(-1)^(n-d)*d^4:d in Divisors(n)]:n in [1..40]]; // Marius A. Burtea, Aug 17 2019

# A version with signs - N. J. A. Sloane, Nov 23 2018
zet1:=(n,i)->add((-1)^(d-1)*d^i, d in divisors(n));
szet1:=i->[seq(zet1(n,i),n=1..120)];
szet1(4);

f[p_, e_] := If[p == 2, (2^(4*(e + 1)) - 31)/15, (p^(4*(e + 1)) - 1)/(p^4 - 1)]; a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 40] (* Amiram Eldar, Aug 17 2019 *)

a(n) = sumdiv(n, d, (-1)^(n-d)*d^4); \\ Michel Marcus, Jan 09 2017

a(n) = Sum_{ d >= 1, d divides n} (-1)^(n-d)*d^4.
Bisection: a(2*j-1) = A001159(2*j-1), a(2*j) = 16*A001159(j) - A051001(j), j >= 1. See the comment above for k=4, and the Hardy reference.
G.f.: Sum_{k>=1} k^4*x^k/(1-(-x)^k).
Multiplicative with a(2^k) = 2^4*(2^(4*k)-1)/(2^4-1) - 1 = (2^(4*(k+1)) - 31)/15 and a(p^k) = (p^(4*(k+1))-1)/(p^4-1) for primes p > 2 (see A001159).

A285989 a(0) = 0, a(n) = Sum_{0 0.

Original entry on oeis.org

0, 1, 16, 82, 256, 626, 1312, 2402, 4096, 6643, 10016, 14642, 20992, 28562, 38432, 51332, 65536, 83522, 106288, 130322, 160256, 196964, 234272, 279842, 335872, 391251, 456992, 538084, 614912, 707282, 821312, 923522, 1048576, 1200644, 1336352, 1503652, 1700608

Offset: 0

Seiichi Manyama, Apr 30 2017

Multiplicative because this sequence is the Dirichlet convolution of A000035 and A000583 which are both multiplicative. - Andrew Howroyd, Aug 05 2018

Robert Israel, Table of n, a(n) for n = 0..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_{0A002131 (k=1), A076577 (k=2), A007331 (k=3), this sequence (k=4), A096960 (k=5), A096961 (k=7), A096962 (k=9), A096963 (k=11).

Cf. A000035, A000583, A007814, A013663, A051001, A206623, A285990.

f:= n -> add((n/d)^4, d = numtheory:-divisors(n/2^padic:-ordp(n,2))); # Robert Israel, Apr 30 2017

{0}~Join~Table[DivisorSum[n, Mod[#, 2] (n/#)^4 &], {n, 36}] (* Michael De Vlieger, Aug 05 2018 *)

a(n)={sumdiv(n, d, (d%2)*(n/d)^4)} \\ Andrew Howroyd, Aug 05 2018

a(n) = A051001(n)*16^A007814(n) for n >= 1. - Robert Israel, Apr 30 2017
From Amiram Eldar, Nov 01 2022: (Start)
Multiplicative with a(2^e) = 2^(4*e) and a(p^e) = (p^(4*e+4)-1)/(p^4-1) for p > 2.
Sum_{k=1..n} a(k) ~ c * n^5, where c = 31*zeta(5)/160 = 0.200904... . (End)
Dirichlet g.f.: zeta(s)*zeta(s-4)*(1-1/2^s). - Amiram Eldar, Jan 08 2023

A321811 Sum of 7th powers of odd divisors of n.

Original entry on oeis.org

1, 1, 2188, 1, 78126, 2188, 823544, 1, 4785157, 78126, 19487172, 2188, 62748518, 823544, 170939688, 1, 410338674, 4785157, 893871740, 78126, 1801914272, 19487172, 3404825448, 2188, 6103593751, 62748518, 10465138360, 823544, 17249876310

Offset: 1

N. J. A. Sloane, Nov 24 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).
Eric Weisstein's World of Mathematics, Odd Divisor Function.
Index entries for sequences mentioned by Glaisher.

Column k=7 of A285425.
Cf. A050999, A051000, A051001, A051002, A321810 - A321816 (analog for 2nd .. 12th powers).
Cf. A321543 - A321565, A321807 - A321836 for related sequences.
Cf. A000265, A013666, A013955.

a[n_] := DivisorSum[n, #^7 &, OddQ[#] &]; Array[a, 20] (* Amiram Eldar, Dec 07 2018 *)

apply( A321811(n)=sigma(n>>valuation(n,2),7), [1..30]) \\ M. F. Hasler, Nov 26 2018

from sympy import divisor_sigma
def A321811(n): return int(divisor_sigma(n>>(~n&n-1).bit_length(),7)) # Chai Wah Wu, Jul 16 2022

a(n) = A013955(A000265(n)) = sigma_7(odd part of n); in particular, a(2^k) = 1 for all k >= 0. - M. F. Hasler, Nov 26 2018
G.f.: Sum_{k>=1} (2*k - 1)^7*x^(2*k-1)/(1 - x^(2*k-1)). - Ilya Gutkovskiy, Dec 07 2018
From Amiram Eldar, Nov 02 2022: (Start)
Multiplicative with a(2^e) = 1 and a(p^e) = (p^(7*e+7)-1)/(p^7-1) for p > 2.
Sum_{k=1..n} a(k) ~ c * n^8, where c = zeta(8)/16 = Pi^8/151200 = 0.0627548... . (End)

A321812 Sum of 8th powers of odd divisors of n.

Original entry on oeis.org

1, 1, 6562, 1, 390626, 6562, 5764802, 1, 43053283, 390626, 214358882, 6562, 815730722, 5764802, 2563287812, 1, 6975757442, 43053283, 16983563042, 390626, 37828630724, 214358882, 78310985282, 6562, 152588281251, 815730722, 282472589764

Offset: 1

N. J. A. Sloane, Nov 24 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).
Eric Weisstein's World of Mathematics, Odd Divisor Function.
Index entries for sequences mentioned by Glaisher.

Column k=8 of A285425.
Cf. A050999, A051000, A051001, A051002, A321810 - A321816 (analog for 2nd .. 12th powers).
Cf. A321543 - A321565, A321807 - A321836 for related sequences.
Cf. A000265, A013667, A013956.

a[n_] := DivisorSum[n, #^8 &, OddQ[#] &]; Array[a, 20] (* Amiram Eldar, Dec 07 2018 *)

apply( A321812(n)=sigma(n>>valuation(n,2),8), [1..30]) \\ M. F. Hasler, Nov 26 2018

from sympy import divisor_sigma
def A321812(n): return int(divisor_sigma(n>>(~n&n-1).bit_length(),8)) # Chai Wah Wu, Jul 16 2022

a(n) = A013956(A000265(n)) = sigma_8(odd part of n); in particular, a(2^k) = 1 for all k >= 0. - M. F. Hasler, Nov 26 2018
G.f.: Sum_{k>=1} (2*k - 1)^8*x^(2*k-1)/(1 - x^(2*k-1)). - Ilya Gutkovskiy, Dec 07 2018
From Amiram Eldar, Nov 02 2022: (Start)
Multiplicative with a(2^e) = 1 and a(p^e) = (p^(8*e+8)-1)/(p^8-1) for p > 2.
Sum_{k=1..n} a(k) ~ c * n^9, where c = zeta(9)/18 = 0.0556671... . (End)

A321813 Sum of 9th powers of odd divisors of n.

Original entry on oeis.org

1, 1, 19684, 1, 1953126, 19684, 40353608, 1, 387440173, 1953126, 2357947692, 19684, 10604499374, 40353608, 38445332184, 1, 118587876498, 387440173, 322687697780, 1953126, 794320419872, 2357947692, 1801152661464, 19684, 3814699218751

Offset: 1

N. J. A. Sloane, Nov 24 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).
Eric Weisstein's World of Mathematics, Odd Divisor Function.
Index entries for sequences mentioned by Glaisher.

Column k=9 of A285425.
Cf. A050999, A051000, A051001, A051002, A321810 - A321816 (analog for 2nd .. 12th powers).
Cf. A321543 - A321565, A321807 - A321836 for related sequences.
Cf. A000265, A013668, A013957.

a[n_] := DivisorSum[n, #^9 &, OddQ[#] &]; Array[a, 20] (* Amiram Eldar, Dec 07 2018 *)

apply( A321813(n)=sigma(n>>valuation(n,2),9), [1..30]) \\ M. F. Hasler, Nov 26 2018

from sympy import divisor_sigma
def A321813(n): return int(divisor_sigma(n>>(~n&n-1).bit_length(),9)) # Chai Wah Wu, Jul 16 2022

a(n) = A013957(A000265(n)) = sigma_9(odd part of n); in particular, a(2^k) = 1 for all k >= 0. - M. F. Hasler, Nov 26 2018
G.f.: Sum_{k>=1} (2*k - 1)^9*x^(2*k-1)/(1 - x^(2*k-1)). - Ilya Gutkovskiy, Dec 07 2018
From Amiram Eldar, Nov 02 2022: (Start)
Multiplicative with a(2^e) = 1 and a(p^e) = (p^(9*e+9)-1)/(p^9-1) for p > 2.
Sum_{k=1..n} a(k) ~ c * n^10, where c = zeta(10)/20 = Pi^10/1871100 = 0.0500497... . (End)

A321814 Sum of 10th powers of odd divisors of n.

Original entry on oeis.org

1, 1, 59050, 1, 9765626, 59050, 282475250, 1, 3486843451, 9765626, 25937424602, 59050, 137858491850, 282475250, 576660215300, 1, 2015993900450, 3486843451, 6131066257802, 9765626, 16680163512500, 25937424602, 41426511213650, 59050

Offset: 1

N. J. A. Sloane, Nov 24 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).
Eric Weisstein's World of Mathematics, Odd Divisor Function.
Index entries for sequences mentioned by Glaisher.

Column k=10 of A285425.
Cf. A050999, A051000, A051001, A051002, A321810 - A321816 (analog for 2nd .. 12th powers).
Cf. A321543 - A321565, A321807 - A321836 for related sequences.
Cf. A000265, A013669, A013958.

a[n_] := DivisorSum[n, #^10 &, OddQ[#] &]; Array[a, 20] (* Amiram Eldar, Dec 07 2018 *)

apply( A321814(n)=sigma(n>>valuation(n,2),10), [1..30]) \\ M. F. Hasler, Nov 26 2018

from sympy import divisor_sigma
def A321814(n): return int(divisor_sigma(n>>(~n&n-1).bit_length(),10)) # Chai Wah Wu, Jul 16 2022

a(n) = A013958(A000265(n)) = sigma_10(odd part of n); in particular, a(2^k) = 1 for all k >= 0. - M. F. Hasler, Nov 26 2018
G.f.: Sum_{k>=1} (2*k - 1)^10*x^(2*k-1)/(1 - x^(2*k-1)). - Ilya Gutkovskiy, Dec 07 2018
From Amiram Eldar, Nov 02 2022: (Start)
Multiplicative with a(2^e) = 1 and a(p^e) = (p^(10*e+10)-1)/(p^10-1) for p > 2.
Sum_{k=1..n} a(k) ~ c * n^11, where c = zeta(11)/22 = 0.045477... . (End)

A321815 Sum of 11th powers of odd divisors of n.

Original entry on oeis.org

1, 1, 177148, 1, 48828126, 177148, 1977326744, 1, 31381236757, 48828126, 285311670612, 177148, 1792160394038, 1977326744, 8649804864648, 1, 34271896307634, 31381236757, 116490258898220, 48828126, 350279478046112, 285311670612, 952809757913928

Offset: 1

N. J. A. Sloane, Nov 24 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).
Eric Weisstein's World of Mathematics, Odd Divisor Function.
Index entries for sequences mentioned by Glaisher.

Column k=11 of A285425.
Cf. A050999, A051000, A051001, A051002, A321810 - A321816 (analog for 2nd .. 12th powers).
Cf. A321543 - A321565, A321807 - A321836 for related sequences.
Cf. A000265, A013670, A013959.

List(List(List([1..25],j->DivisorsInt(j)),i->Filtered(i,k->IsOddInt(k))),m->Sum(m,n->n^11)); # Muniru A Asiru, Dec 07 2018

a[n_] := DivisorSum[n, #^11&, OddQ[#]&]; Array[a, 20] (* Amiram Eldar, Dec 07 2018 *)

apply( A321815(n)=sigma(n>>valuation(n,2),11), [1..30]) \\ M. F. Hasler, Nov 26 2018

from sympy import divisor_sigma
def A321815(n): return int(divisor_sigma(n>>(~n&n-1).bit_length(),11)) # Chai Wah Wu, Jul 16 2022

a(n) = A013959(A000265(n)) = sigma_11(odd part of n); in particular, a(2^k) = 1 for all k >= 0. - M. F. Hasler, Nov 26 2018
G.f.: Sum_{k>=1} (2*k - 1)^11*x^(2*k-1)/(1 - x^(2*k-1)). - Ilya Gutkovskiy, Dec 22 2018
From Amiram Eldar, Nov 02 2022: (Start)
Multiplicative with a(2^e) = 1 and a(p^e) = (p^(11*e+11)-1)/(p^11-1) for p > 2.
Sum_{k=1..n} a(k) ~ c * n^12, where c = zeta(12)/24 = 691*Pi^12/15324309000 = 0.0416769... . (End)

A347175 Sum of 4th powers of odd divisors of n that are <= sqrt(n).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 82, 626, 1, 82, 1, 1, 707, 1, 1, 82, 1, 626, 82, 1, 1, 82, 626, 1, 82, 1, 1, 707, 1, 1, 82, 2402, 626, 82, 1, 1, 82, 626, 2402, 82, 1, 1, 707, 1, 1, 2483, 1, 626, 82, 1, 1, 82, 3027, 1, 82, 1, 1, 707

Offset: 1

Ilya Gutkovskiy, Aug 21 2021

			a(18) = 82 as the odd divisors of 18 are the divisors of 9 which are 1, 3 and 9. Of those, 1 and 3 are <= sqrt(18) so we find the sum of fourth powers of 1 and 3 then add them i.e., a(18) = 1^4 + 3^4 = 82. - _David A. Corneth_, Feb 24 2024

David A. Corneth, Table of n, a(n) for n = 1..10000

Cf. A001159, A051001, A069288, A069289, A347143, A347172, A347173, A347174.

Table[DivisorSum[n, #^4 &, # <= Sqrt[n] && OddQ[#] &], {n, 1, 75}]
nmax = 75; CoefficientList[Series[Sum[(2 k - 1)^4 x^((2 k - 1)^2)/(1 - x^(2 k - 1)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest

a(n) = {
	my(s = sqrtint(n), res);
	n>>=valuation(n, 2);
	d = divisors(n);
	for(i = 1, #d,
		if(d[i] <= s,
			res += d[i]^4
		,
			return(res)
		)
	); res
} \\ David A. Corneth, Feb 24 2024

G.f.: Sum_{k>=1} (2*k - 1)^4 * x^((2*k - 1)^2) / (1 - x^(2*k - 1)).

A347172 Sum of 4th powers of odd divisors of n that are < sqrt(n).

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 82, 1, 1, 707, 1, 1, 82, 1, 626, 82, 1, 1, 82, 626, 1, 82, 1, 1, 707, 1, 1, 82, 1, 626, 82, 1, 1, 82, 626, 2402, 82, 1, 1, 707, 1, 1, 2483, 1, 626, 82, 1, 1, 82, 3027, 1, 82, 1, 1, 707

Offset: 1

Ilya Gutkovskiy, Aug 21 2021

nonn

Cf. A001159, A051001, A333805, A333807, A347142, A347161, A347162.

Table[DivisorSum[n, #^4 &, # < Sqrt[n] && OddQ[#] &], {n, 1, 75}]
nmax = 75; CoefficientList[Series[Sum[(2 k - 1)^4 x^(2 k (2 k - 1))/(1 - x^(2 k - 1)), {k, 1, nmax}], {x, 0, nmax}], x] // Rest

G.f.: Sum_{k>=1} (2*k - 1)^4 * x^(2*k*(2*k - 1)) / (1 - x^(2*k - 1)).

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A285989 a(0) = 0, a(n) = Sum_{0 0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A321811 Sum of 7th powers of odd divisors of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A321812 Sum of 8th powers of odd divisors of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A321813 Sum of 9th powers of odd divisors of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A321814 Sum of 10th powers of odd divisors of n.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A321815 Sum of 11th powers of odd divisors of n.

Views

Author

Keywords

Links

Crossrefs

Programs

GAP

Mathematica