A001157 -id:A001157 - cp's OEIS frontend

A013961 a(n) = sigma_13(n), the sum of the 13th powers of the divisors of n.

1, 8193, 1594324, 67117057, 1220703126, 13062296532, 96889010408, 549822930945, 2541867422653, 10001220711318, 34522712143932, 107006334784468, 302875106592254, 793811662272744, 1946196290656824, 4504149450301441, 9904578032905938, 20825519793796029, 42052983462257060

Offset: 1

N. J. A. Sloane

If the canonical factorization of n into prime powers is the product of p^e(p) then sigma_k(n) = Product_{p prime} ((p^((e(p)+1)*k)) - 1)/(p^k - 1).
Sum_{d|n} 1/d^k is equal to sigma_k(n)/n^k. So sequences A017665-A017712 also give the numerators and denominators of sigma_k(n)/n^k for k = 1..24. The power sums sigma_k(n) are in sequences A000203 (k=1), A001157-A001160 (k=2,3,4,5), A013954-A013972 for k = 6,7,...,24. - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 05 2001
By Fermat's little theorem n^13 == n (mod 13). Hence sigma_13(n) == sigma_(1) (mod 13). In fact, sigma_13(n) == sigma_(1) (mod 2730), where 2730 = 2*3*5*7*13 = the numerator of Bernoulli(12). - Peter Bala, Jan 12 2025

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index entries for sequences related to sigma(n).

Cf. A000203, A001157-A001160, A013672, A013954-A013972, A017665-A017712.

[DivisorSigma(13, n): n in [1..20]]; // Vincenzo Librandi, Sep 10 2016

A013961 := proc(n)
    numtheory[sigma][13](n) ;
end proc: # R. J. Mathar, Sep 21 2017

DivisorSigma[13, Range[30]] (* Vincenzo Librandi, Sep 10 2016 *)

my(N=99, q='q+O('q^N)); Vec(sum(n=1, N, n^13*q^n/(1-q^n))) \\ Altug Alkan, Sep 10 2016

a(n) = sigma(n, 13); \\ Michel Marcus, Sep 10 2016

[sigma(n,13)for n in range(1,16)] # Zerinvary Lajos, Jun 04 2009

G.f.: Sum_{k>=1} k^13*x^k/(1-x^k). - Benoit Cloitre, Apr 21 2003
Dirichlet g.f.: zeta(s-13)*zeta(s). - Ilya Gutkovskiy, Sep 10 2016
Empirical: Sum_{n>=1} a(n)/exp(2*Pi*n) = 1/24. - Simon Plouffe, Mar 01 2021
From Amiram Eldar, Oct 29 2023: (Start)
Multiplicative with a(p^e) = (p^(13*e+13)-1)/(p^13-1).
Sum_{k=1..n} a(k) = zeta(14) * n^14 / 14 + O(n^15). (End)

A020486 Average of squares of divisors is an integer: numbers k such that sigma_0(k) divides sigma_2(k).

Original entry on oeis.org

1, 3, 4, 5, 7, 11, 12, 13, 15, 17, 19, 20, 21, 23, 25, 27, 28, 29, 31, 33, 35, 37, 39, 41, 43, 44, 47, 48, 49, 51, 52, 53, 55, 57, 59, 60, 61, 65, 67, 68, 69, 71, 73, 75, 76, 77, 79, 83, 84, 85, 87, 89, 91, 92, 93, 95, 97, 100, 101, 103, 105, 107, 108, 109, 111, 112, 113, 115, 116

Offset: 1

David W. Wilson

nonn

If sigma_2(k)/sigma_0(k) is a square then k is an RMS-number (A140480). - Ctibor O. Zizka, Jul 14 2008

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from T. D. Noe)

Cf. A000005, A001157, A140480.

a020486 n = a020486_list !! (n-1)
a020486_list = filter (\x -> a001157 x `mod` a000005 x == 0) [1..]
-- Reinhard Zumkeller, Jan 15 2013

[n: n in [1..120] | IsZero(DivisorSigma(2, n) mod NumberOfDivisors(n))]; // Bruno Berselli, Apr 11 2013

Select[Range[150],Divisible[DivisorSigma[2,#],DivisorSigma[0,#]]&] (* Harvey P. Dale, May 03 2011 *)

is(n)=sigma(n,2)%numdiv(n)==0 \\ Charles R Greathouse IV, Jul 02 2013

A001157(k) mod A000005(k) = 0. - Reinhard Zumkeller, Jan 15 2013

A066183 Total sum of squares of parts in all partitions of n.

Original entry on oeis.org

1, 6, 17, 44, 87, 180, 311, 558, 910, 1494, 2302, 3608, 5343, 7986, 11554, 16714, 23549, 33270, 45942, 63506, 86338, 117156, 156899, 209926, 277520, 366260, 479012, 624956, 808935, 1044994, 1340364, 1715572, 2182935, 2770942, 3499379

Offset: 1

Wouter Meeussen, Dec 15 2001

nonn

Sum of hook lengths of all boxes in the Ferrers diagrams of all partitions of n (see the Guo-Niu Han paper, p. 25, Corollary 6.5). Example: a(3) = 17 because for the partitions (3), (2,1), (1,1,1) of n=3 the hook length multi-sets are {3,2,1}, {3,1,1}, {3,2,1}, respectively; the total sum of all hook lengths is 6+5+6 = 17. - Emeric Deutsch, May 15 2008
Partial sums of A206440. - Omar E. Pol, Feb 08 2012
Column k=2 of A213191. - Alois P. Heinz, Sep 20 2013
Row sums of triangles A180681, A206561 and A299768. - Omar E. Pol, Mar 20 2018

			a(3) = 17 because the squares of all partitions of 3 are {9}, {4,1} and {1,1,1}, summing to 17.

Alois P. Heinz, Table of n, a(n) for n = 1..10000
Guo-Niu Han, An explicit expansion formula for the powers of the Euler product in terms of partition hook lengths, arXiv:0804.1849v3 [math.CO], May 09 2008.

Cf. A000041, A001157, A180681, A206440, A206561, A213191, A263004, A265245, A299768.

b:= proc(n, i) option remember; local g, h;
      if n=0 then [1, 0]
    elif i<1 then [0, 0]
    elif i>n then b(n, i-1)
    else g:= b(n, i-1); h:= b(n-i, i);
         [g[1]+h[1], g[2]+h[2] +h[1]*i^2]
      fi
    end:
a:= n-> b(n, n)[2]:
seq(a(n), n=1..40);  # Alois P. Heinz, Feb 23 2012
# second Maple program:
g := (sum(k^2*x^k/(1-x^k), k = 1..100))/(product(1-x^k, k = 1..100)): gser := series(g, x = 0, 45): seq(coeff(gser, x, m), m = 1 .. 40); # Emeric Deutsch, Dec 06 2015

Table[Apply[Plus, IntegerPartitions[n]^2, {0, 2}], {n, 30}]
(* Second program: *)
b[n_, i_] := b[n, i] = Module[{g, h}, Which[n==0, {1, 0}, i<1, {0, 0}, i>n, b[n, i-1], True, g = b[n, i-1]; h = b[n-i, i]; {g[[1]] + h[[1]], g[[2]] + h[[2]] + h[[1]]*i^2}]]; a[n_] :=  b[n, n][[2]]; Table[a[n], {n, 1, 40}] (* Jean-François Alcover, Aug 31 2015, after Alois P. Heinz *)

a(n)=my(s); forpart(v=n,s+=sum(i=1,#v,v[i]^2));s \\ Charles R Greathouse IV, Aug 31 2015

a(n)=sum(k=1,n,sigma(k,2)*numbpart(n-k)) \\ Charles R Greathouse IV, Aug 31 2015

a(n) = Sum_{k=1..n} sigma_2(k)*numbpart(n-k), where sigma_2(k)=sum of squares of divisors of k=A001157(k). - Vladeta Jovovic, Jan 26 2002
a(n) = Sum_{k>=0} k*A265245(n,k). - Emeric Deutsch, Dec 06 2015
G.f.: g(x) = (Sum_{k>=1} k^2*x^k/(1-x^k))/Product_{q>=1} (1-x^q). - Emeric Deutsch, Dec 06 2015
a(n) ~ 3*sqrt(2)*Zeta(3)/Pi^3 * exp(Pi*sqrt(2*n/3)) * sqrt(n). - Vaclav Kotesovec, May 28 2018

More terms from Naohiro Nomoto, Feb 07 2002

A064605 Numbers k such that A064602(k) is divisible by k.

Original entry on oeis.org

1, 2, 8, 74, 146, 150, 158, 307, 526, 541, 16157, 20289, 271343, 953614, 1002122, 2233204, 3015123, 15988923, 48033767, 85110518238

Offset: 1

Labos Elemer, Sep 24 2001

Analogous sequences for various arithmetical functions are A050226, A056650, A064605, A064606, A064607, A064610, A064611, A048290, A062982, A045345.
a(20) > 3*10^10. - Donovan Johnson, Aug 31 2012
a(21) > 10^11, if it exists. - Amiram Eldar, Jan 18 2024

			Summing divisor-square sums for j = 1..8 gives 1+5+10+21+26+50+50+85 = 248, which is divisible by 8, so 8 is a term and the integer quotient is 31.

Cf. A001157, A064602, A050226, A056650, A064606, A064607, A064610, A064611, A064612, A048290, A062982, A045345.

k = 1; lst = {}; s = 0; While[k < 1000000001, s = s + DivisorSigma[2, k]; If[ Mod[s, k] == 0, AppendTo[lst, k]; Print@ k]; k++]; lst (* Robert G. Wilson v, Apr 25 2011 *)

(Sum_{j=1..k} sigma_2(j)) mod k = A064602(k) mod k = 0.

a(15)-a(19) from Donovan Johnson, Jun 21 2010

a(20) from Amiram Eldar, Jan 18 2024

A076577 Sum of squares of divisors d of n such that n/d is odd.

Original entry on oeis.org

1, 4, 10, 16, 26, 40, 50, 64, 91, 104, 122, 160, 170, 200, 260, 256, 290, 364, 362, 416, 500, 488, 530, 640, 651, 680, 820, 800, 842, 1040, 962, 1024, 1220, 1160, 1300, 1456, 1370, 1448, 1700, 1664, 1682, 2000, 1850, 1952, 2366, 2120, 2210, 2560, 2451, 2604

Offset: 1

Vladeta Jovovic, Oct 19 2002

			G.f. = x + 4*x^2 + 10*x^3 + 16*x^4 + 26*x^5 + 40*x^6 + 50*x^7 + 64*x^8 + ...

Robert Israel, 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. A001227, A002131, A001157, A050999.

Glaisher's Delta'_i (i=0..12): A001227, A002131, A076577, A007331, A285989, A096960, A321817, A096961, A321818, A096962, A321819, A096963, A321820

a:= n -> mul(`if`(t[1]=2, 2^(2*t[2]),
     (t[1]^(2*(1+t[2]))-1)/(t[1]^2-1)),t=ifactors(n)[2]):
map(a, [$1..100]); # Robert Israel, Jul 05 2016

a[ n_] := If[ n < 1, 0, Sum[ d^2 Mod[ n/d, 2], {d, Divisors @ n}]]; (* Michael Somos, Jun 09 2014 *)
Table[CoefficientList[Series[-Log[Product[(x^k - 1)^k/(x^k + 1)^k, {k, 1, 80}]]/2, {x, 0, 80}], x][[n + 1]] n, {n, 1, 80}] (* Benedict W. J. Irwin, Jul 05 2016 *)
f[2, e_] := 4^e; f[p_, e_] := (p^(2*e + 2) - 1)/(p^2 - 1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 15 2020 *)

a(n) = sumdiv(n, d, d^2*((n/d) % 2)); \\ Michel Marcus, Jun 09 2014

G.f.: Sum_{m>0} m^2*x^m/(1-x^(2*m)). More generally, if b(n, k) is sum of k-th powers of divisors d of n such that n/d is odd then b(2n, k) = sigma_k(2n)-sigma_k(n), b(2n+1, k) = sigma_k(2n+1), where sigma_k(n) is sum of k-th powers of divisors of n. G.f. for b(n, k): Sum_{m>0} m^k*x^m/(1-x^(2*m)).
b(n, k) is multiplicative: b(2^e, k) = 2^(k*e), b(p^e, k) = (p^(ke+k)-1)/(p^k-1) for an odd prime p.
a(2*n) = sigma_2(2*n)-sigma_2(n), a(2*n+1) = sigma_2(2*n+1), where sigma_2(n) is sum of squares of divisors of n (cf. A001157).
b(n, k) = (sigma_k(2n)-sigma_k(n))/2^k. - Vladeta Jovovic, Oct 06 2003
Dirichlet g.f.: zeta(s)*(1-1/2^s)*zeta(s-2). - Geoffrey Critzer, Mar 28 2015
L.g.f.: -log(Product_{ k>0 } (x^k-1)^k/(x^k+1)^k)/2 = Sum_{ n>0 } (a(n)/n)*x^n. - Benedict W. J. Irwin, Jul 05 2016
Sum_{k=1..n} a(k) ~ 7*Zeta(3)*n^3 / 24. - Vaclav Kotesovec, Feb 08 2019

A275585 Expansion of Product_{k>=1} 1/(1 - x^k)^(sigma_2(k)).

Original entry on oeis.org

1, 1, 6, 16, 52, 128, 373, 913, 2399, 5796, 14298, 33655, 79756, 183078, 419846, 942807, 2106176, 4633208, 10127557, 21870997, 46912648, 99639685, 210206722, 439777198, 914157490, 1886428608, 3869204040, 7884691072, 15976273573, 32182538964, 64484592372, 128518359868, 254868985099, 502950483815, 987904826874, 1931596634076

Offset: 0

Ilya Gutkovskiy, Dec 25 2016

nonn

Euler transform of the sum of squares of divisors (A001157).

Seiichi Manyama, Table of n, a(n) for n = 0..10000
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
N. J. A. Sloane, Transforms
Index entries for sequences related to sums of divisors

Cf. A001157, A027847, A288414.

Product_{k>=1} 1/(1 - x^k)^sigma_m(k): A006171 (m=0), A061256 (m=1), this sequence (m=2), A288391 (m=3), A301542 (m=4), A301543 (m=5), A301544 (m=6), A301545 (m=7), A301546 (m=8), A301547 (m=9).

with(numtheory):
a:= proc(n) option remember; `if`(n=0, 1, add(add(
      d*sigma[2](d), d=divisors(j))*a(n-j), j=1..n)/n)
    end:
seq(a(n), n=0..40);  # Alois P. Heinz, Jun 08 2017

nmax = 35; CoefficientList[Series[Product[1/(1 - x^k)^(DivisorSigma[2, k]), {k, 1, nmax}], {x, 0, nmax}], x]

G.f.: Product_{k>=1} 1/(1 - x^k)^(sigma_2(k)).
a(0) = 1, a(n) = (1/n)*Sum_{k=1..n} A027847(k)*a(n-k) for n > 0. - Seiichi Manyama, Jun 08 2017
a(n) ~ exp(4*Pi * Zeta(3)^(1/4) * n^(3/4) / (3^(5/4) * 5^(1/4)) - Pi * 5^(1/4) * n^(1/4) / (8 * 3^(7/4) * Zeta(3)^(1/4)) + Zeta(3) / (8*Pi^2)) * Zeta(3)^(1/8) / (2^(3/2) * 15^(1/8) * n^(5/8)). - Vaclav Kotesovec, Mar 23 2018
G.f.: exp(Sum_{k>=1} sigma_3(k)*x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Oct 26 2018

A343497 a(n) = Sum_{k=1..n} gcd(k, n)^3.

Original entry on oeis.org

1, 9, 29, 74, 129, 261, 349, 596, 789, 1161, 1341, 2146, 2209, 3141, 3741, 4776, 4929, 7101, 6877, 9546, 10121, 12069, 12189, 17284, 16145, 19881, 21321, 25826, 24417, 33669, 29821, 38224, 38889, 44361, 45021, 58386, 50689, 61893, 64061, 76884, 68961, 91089, 79549, 99234, 101781

Offset: 1

Seiichi Manyama, Apr 17 2021

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

Column 3 of A343510.

Cf. A000010, A001157 (sigma_2(n)), A018804, A054610, A069097, A309323, A332517, A342423, A342433, A343498, A343499, A343513.

A343497:= func< n | (&+[d^3*EulerPhi(Floor(n/d)): d in Divisors(n)]) >;
[A343497(n): n in [1..50]]; // G. C. Greubel, Jun 24 2024

with(numtheory):
seq(add(phi(n/d) * d^3, d in divisors(n)), n = 1..50); # Peter Bala, Jan 20 2024

a[n_] := Sum[GCD[k, n]^3, {k, 1, n}]; Array[a, 50] (* Amiram Eldar, Apr 18 2021 *)
f[p_, e_] := p^(e - 1)*((p^2 + p + 1)*p^(2*e) - 1)/(p + 1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 50] (* Amiram Eldar, Nov 22 2022 *)
A343497[n_]:= DivisorSum[n, #^3*EulerPhi[n/#] &]; Table[A343497[n], {n, 50}] (* G. C. Greubel, Jun 24 2024 *)

PARI
```
a(n) = sum(k=1, n, gcd(k, n)^3);
```

a(n) = sumdiv(n, d, eulerphi(n/d)*d^3);

a(n) = sumdiv(n, d, moebius(n/d)*d*sigma(d, 2));

my(N=40, x='x+O('x^N)); Vec(sum(k=1, N, eulerphi(k)*x^k*(1+4*x^k+x^(2*k))/(1-x^k)^4))

def A343497(n): return sum(k^3*euler_phi(n/k) for k in (1..n) if (k).divides(n))
[A343497(n) for n in range(1,51)] # G. C. Greubel, Jun 24 2024

a(n) = Sum_{d|n} phi(n/d) * d^3.
a(n) = Sum_{d|n} mu(n/d) * d * sigma_2(d).
G.f.: Sum_{k >= 1} phi(k) * x^k * (1 + 4*x^k + x^(2*k))/(1 - x^k)^4.
Dirichlet g.f.: zeta(s-1) * zeta(s-3) / zeta(s). - Ilya Gutkovskiy, Apr 18 2021
Sum_{k=1..n} a(k) ~ 45*zeta(3)*n^4 / (2*Pi^4). - Vaclav Kotesovec, May 20 2021
Multiplicative with a(p^e) = p^(e-1)*((p^2+p+1)*p^(2*e) - 1)/(p+1). - Amiram Eldar, Nov 22 2022
a(n) = Sum_{1 <= i, j, k <= n} gcd(i, j, k, n) = Sum_{d divides n} d * J_3(n/d), where the Jordan totient function J_3(n) = A059376(n). - Peter Bala, Jan 20 2024

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

A084218 a(n) = sigma_4(n^2)/sigma_2(n^2).

Original entry on oeis.org

1, 13, 73, 205, 601, 949, 2353, 3277, 5905, 7813, 14521, 14965, 28393, 30589, 43873, 52429, 83233, 76765, 129961, 123205, 171769, 188773, 279313, 239221, 375601, 369109, 478297, 482365, 706441, 570349, 922561, 838861, 1060033, 1082029

Offset: 1

Benoit Cloitre, Jun 21 2003

G. C. Greubel, Table of n, a(n) for n = 1..10000

Cf. A001157, A001159, A002117, A007434, A013663, A065827.
Cf. A068963, A372962, A372963, A373007.
Cf. A057660, A084220, A372966, A373105.

with(numtheory): a:=n->sigma[4](n^2)/sigma[2](n^2): seq(a(n),n=1..40); # Muniru A Asiru, Oct 09 2018

Table[DivisorSigma[4, n^2]/DivisorSigma[2, n^2], {n, 1, 50}] (* G. C. Greubel, Oct 08 2018 *)
f[p_, e_] := (p^(4*e + 2) + 1)/(p^2 + 1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 35] (* Amiram Eldar, Sep 13 2020 *)

a(n)=sumdiv(n^2,d,d^4)/sumdiv(n^2,d,d^2)

a(n) = sigma(n^2, 4)/sigma(n^2, 2); \\ Michel Marcus, Oct 09 2018

Multiplicative with a(p^e) = (p^(4*e + 2) + 1)/(p^2 + 1). - Amiram Eldar, Sep 13 2020
Sum_{k>=1} 1/a(k) = 1.09957644430375183822287768590764825667080036406680891521221069625517483696... - Vaclav Kotesovec, Sep 24 2020
Sum_{k=1..n} a(k) ~ c * n^5, where c = zeta(5)/(5*zeta(3)) = 0.172525... . - Amiram Eldar, Oct 30 2022
From Peter Bala, Jan 18 2024: (Start)
a(n) = Sum_{d divides n} J_2(d^2) = Sum_{d divides n} d^2 * J_2(d), where the Jordan totient function J_2(n) = A007434(n).
a(n) = Sum_{1 <= j, k <= n} ( n/gcd(j, k, n) )^2.
Dirichlet g.f.: zeta(s) * zeta(s-4) / zeta(s-2) [Corrected by Michael Shamos, May 18 2025]. (End)
a(n) = Sum_{d|n} mu(n/d) * (n/d)^2 * sigma_4(d). - Seiichi Manyama, May 18 2024

A013958 a(n) = sigma_10(n), the sum of the 10th powers of the divisors of n.

Original entry on oeis.org

1, 1025, 59050, 1049601, 9765626, 60526250, 282475250, 1074791425, 3486843451, 10009766650, 25937424602, 61978939050, 137858491850, 289537131250, 576660215300, 1100586419201, 2015993900450, 3574014537275, 6131066257802, 10250010815226, 16680163512500, 26585860217050

Offset: 1

N. J. A. Sloane

If the canonical factorization of n into prime powers is the product of p^e(p) then sigma_k(n) = Product_p ((p^((e(p)+1)*k))-1)/(p^k-1).

Sum_{d|n} 1/d^k is equal to sigma_k(n)/n^k. So sequences A017665-A017712 also give the numerators and denominators of sigma_k(n)/n^k for k = 1..24. The power sums sigma_k(n) are in sequences A000203 (k=1), A001157-A001160 (k=2,3,4,5), A013954-A013972 for k = 6,7,...,24. - Ahmed Fares (ahmedfares(AT)my-deja.com), Apr 05 2001

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Index entries for sequences related to sigma(n).

Cf. A000203, A001157-A001160, A013669, A013954-A013972, A017665-A017712.

[DivisorSigma(10,n): n in [1..20]]; // Bruno Berselli, Apr 10 2013

lst={};Do[AppendTo[lst,DivisorSigma[10,n]],{n,5!}];lst (* Vladimir Joseph Stephan Orlovsky, Mar 11 2009 *)
DivisorSigma[10,Range[20]] (* Harvey P. Dale, Jan 04 2012 *)

a(n)=sigma(n,10) \\ Charles R Greathouse IV, Apr 28 2011

[sigma(n,10)for n in range(1,18)] # Zerinvary Lajos, Jun 04 2009

G.f.: Sum_{k>=1} k^10*x^k/(1-x^k). - Benoit Cloitre, Apr 21 2003
L.g.f.: -log(Product_{k>=1} (1 - x^k)^(k^9)) = Sum_{n>=1} a(n)*x^n/n. - Ilya Gutkovskiy, May 06 2017
From Amiram Eldar, Oct 29 2023: (Start)
Multiplicative with a(p^e) = (p^(10*e+10)-1)/(p^10-1).
Dirichlet g.f.: zeta(s)*zeta(s-10).
Sum_{k=1..n} a(k) = zeta(11) * n^11 / 11 + O(n^12). (End)

cp's OEIS Frontend

A013961 a(n) = sigma_13(n), the sum of the 13th powers of the divisors of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

PARI

Sage

Formula

A020486 Average of squares of divisors is an integer: numbers k such that sigma_0(k) divides sigma_2(k).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

A066183 Total sum of squares of parts in all partitions of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

Extensions

A064605 Numbers k such that A064602(k) is divisible by k.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

Extensions

A076577 Sum of squares of divisors d of n such that n/d is odd.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A275585 Expansion of Product_{k>=1} 1/(1 - x^k)^(sigma_2(k)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A343497 a(n) = Sum_{k=1..n} gcd(k, n)^3.

Views

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