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
- 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
-
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]
A328259
a(n) = n * sigma_2(n).
Original entry on oeis.org
1, 10, 30, 84, 130, 300, 350, 680, 819, 1300, 1342, 2520, 2210, 3500, 3900, 5456, 4930, 8190, 6878, 10920, 10500, 13420, 12190, 20400, 16275, 22100, 22140, 29400, 24418, 39000, 29822, 43680, 40260, 49300, 45500, 68796, 50690, 68780, 66300, 88400, 68962, 105000, 79550, 112728, 106470
Offset: 1
-
Table[n DivisorSigma[2, n], {n, 1, 45}]
nmax = 45; CoefficientList[Series[Sum[k^3 x^k/(1 - x^k)^2, {k, 1, nmax}], {x, 0, nmax}], x] // Rest
-
a(n) = n*sigma(n, 2); \\ Michel Marcus, Dec 02 2020
A027848
a(n) = Sum_{ d|n } sigma(n/d)*d^4.
Original entry on oeis.org
1, 19, 85, 311, 631, 1615, 2409, 4991, 6898, 11989, 14653, 26435, 28575, 45771, 53635, 79887, 83539, 131062, 130341, 196241, 204765, 278407, 279865, 424235, 394406, 542925, 558778, 749199, 707311, 1019065, 923553, 1278255, 1245505, 1587241, 1520079, 2145278, 1874199, 2476479, 2428875, 3149321, 2825803, 3890535, 3418845, 4557083, 4352638, 5317435
Offset: 1
-
f[p_, e_] := (1 + p + p^2 - p^(e+1) - p^(e+2) - p^(e+3) - p^(e+4) + p^(4*e+7))/(1 - p^3 - p^4 + p^7); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 50] (* Amiram Eldar, Oct 03 2023 *)
-
N=66; x='x+O('x^N); /* that many terms */
c=sum(j=1,N,j*x^j);
t=log(1/prod(j=1,N, eta(x^(j))^(j^3)));
Vec(serconvol(t,c)) /* show terms */
/* Joerg Arndt, May 03 2008 */
Original entry on oeis.org
1, 9, 31, 73, 131, 279, 351, 585, 850, 1179, 1343, 2263, 2211, 3159, 4061, 4681, 4931, 7650, 6879, 9563, 10881, 12087, 12191, 18135, 16406, 19899, 22990, 25623, 24419, 36549, 29823, 37449, 41633, 44379, 45981, 62050, 50691, 61911, 68541, 76635, 68963, 97929
Offset: 1
-
f[p_, e_] := (p^(3*e+5) - (p^2+p+1)*p^(e+1) + p + 1)/((p^3-1)*(p^2-1)); f[2, e_] := (8^(e+1)-1)/7; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 50] (* Amiram Eldar, Nov 13 2022 *)
-
a(n)={sumdiv(n, d, (n/d)^3*sigma(d>>valuation(d,2)))} \\ Andrew Howroyd, Jul 27 2018
A288389
Expansion of Product_{k>=1} (1 - x^k)^(sigma_2(k)).
Original entry on oeis.org
1, -1, -5, -5, -1, 35, 66, 100, 15, -330, -841, -1591, -1468, 426, 6306, 16399, 27745, 31544, 6364, -70389, -225322, -435265, -617937, -537135, 176008, 1970213, 5150080, 9277624, 12631298, 11048049, -1884235, -34460900, -92385183, -171971785, -247790333
Offset: 0
-
m:=50; R:=PowerSeriesRing(Rationals(), m); Coefficients(R! ( (&*[(1-q^k)^DivisorSigma(2,k): k in [1..m]]) )); // G. C. Greubel, Oct 30 2018
-
with(numtheory):
b:= proc(n) option remember; `if`(n=0, 1, add(add(
d*sigma[2](d), d=divisors(j))*b(n-j), j=1..n)/n)
end:
a:= proc(n) option remember; `if`(n=0, 1,
-add(b(n-i)*a(i), i=0..n-1))
end:
seq(a(n), n=0..40); # Alois P. Heinz, Jun 08 2017
-
nmax = 50; CoefficientList[Series[Product[(1-x^k)^DivisorSigma[2, k], {k, 1, nmax}], {x, 0, nmax}], x] (* G. C. Greubel, Oct 30 2018 *)
-
m=50; x='x+O('x^m); Vec(prod(k=1, m, (1-x^k)^sigma(k,2))) \\ G. C. Greubel, Oct 30 2018
A320940
a(n) = Sum_{d|n} d*sigma_n(d).
Original entry on oeis.org
1, 11, 85, 1127, 15631, 287021, 5764809, 135007759, 3487020610, 100146496681, 3138428376733, 107032667155169, 3937376385699303, 155582338242604221, 6568408966322733475, 295154660699054931999, 14063084452067724991027, 708239400347943609329270
Offset: 1
a(6) = 1*sigma_6(1)+2*sigma_6(2)+3*sigma_6(3)+6*sigma_6(6) = 1+2*65+3*730+6*47450 = 287021.
-
[&+[d*DivisorSigma(n,d):d in Divisors(n)]:n in [1..18]]; // Marius A. Burtea, Feb 15 2020
-
with(numtheory): seq(coeff(series(n*(-log(mul((1-x^k)^sigma[n](k),k=1..n))),x,n+1), x, n), n = 1 .. 20); # Muniru A Asiru, Oct 28 2018
-
Table[Sum[d DivisorSigma[n, d], {d, Divisors[n]}] , {n, 18}]
Table[n SeriesCoefficient[-Log[Product[(1 - x^k)^DivisorSigma[n, k], {k, 1, n}]], {x, 0, n}], {n, 18}]
-
a(n) = sumdiv(n, d, d*sigma(d, n)); \\ Michel Marcus, Oct 28 2018
-
from sympy import divisor_sigma, divisors
def A320940(n):
return sum(divisor_sigma(d)*(n//d)**(n+1) for d in divisors(n,generator=True)) # Chai Wah Wu, Feb 15 2020
A322104
Square array A(n,k), n >= 1, k >= 0, read by antidiagonals: A(n,k) = Sum_{d|n} d*sigma_k(d).
Original entry on oeis.org
1, 1, 5, 1, 7, 7, 1, 11, 13, 17, 1, 19, 31, 35, 11, 1, 35, 85, 95, 31, 35, 1, 67, 247, 311, 131, 91, 15, 1, 131, 733, 1127, 631, 341, 57, 49, 1, 259, 2191, 4295, 3131, 1615, 351, 155, 34, 1, 515, 6565, 16775, 15631, 8645, 2409, 775, 130, 55, 1, 1027, 19687, 66311, 78131, 49111, 16815, 4991, 850, 217, 23
Offset: 1
Square array begins:
1, 1, 1, 1, 1, 1, ...
5, 7, 11, 19, 35, 67, ...
7, 13, 31, 85, 247, 733, ...
17, 35, 95, 311, 1127, 4295, ...
11, 31, 131, 631, 3131, 15631, ...
35, 91, 341, 1615, 8645, 49111, ...
-
Table[Function[k, Sum[d DivisorSigma[k, d], {d, Divisors[n]}]][i - n], {i, 0, 11}, {n, 1, i}] // Flatten
Table[Function[k, SeriesCoefficient[Sum[j DivisorSigma[k, j] x^j/(1 - x^j), {j, 1, n}], {x, 0, n}]][i - n], {i, 0, 11}, {n, 1, i}] // Flatten
-
T(n,k)={sumdiv(n, d, d^(k+1)*sigma(n/d))}
for(n=1, 10, for(k=0, 8, print1(T(n, k), ", ")); print); \\ Andrew Howroyd, Nov 26 2018
A344787
a(n) = n * Sum_{d|n} sigma_d(d) / d, where sigma_k(n) is the sum of the k-th powers of the divisors of n.
Original entry on oeis.org
1, 7, 31, 287, 3131, 47527, 823551, 16843583, 387440266, 10009772937, 285311670623, 8918294639219, 302875106592267, 11112685050294387, 437893920912795941, 18447025553014982271, 827240261886336764195, 39346558271492953948522, 1978419655660313589123999
Offset: 1
a(4) = 4 * Sum_{d|4} sigma_d(d) / d = 4 * ((1^1)/1 + (1^2 + 2^2)/2 + (1^4 + 2^4 + 4^4)/4) = 287.
-
Table[n*Sum[DivisorSigma[k, k] (1 - Ceiling[n/k] + Floor[n/k])/k, {k, n}], {n, 20}]
-
my(N=20, x='x+O('x^N)); Vec(sum(k=1, N, sigma(k, k)*x^k/(1-x^k)^2)) \\ Seiichi Manyama, Dec 16 2022
Showing 1-8 of 8 results.
Comments