cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-8 of 8 results.

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

Views

Author

Ilya Gutkovskiy, Dec 25 2016

Keywords

Comments

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

Crossrefs

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

Programs

  • Maple
    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
  • Mathematica
    nmax = 35; CoefficientList[Series[Product[1/(1 - x^k)^(DivisorSigma[2, k]), {k, 1, nmax}], {x, 0, nmax}], x]

Formula

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

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

Views

Author

Ilya Gutkovskiy, Oct 09 2019

Keywords

Comments

Moebius transform of A027847.

Crossrefs

Programs

  • Mathematica
    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
  • PARI
    a(n) = n*sigma(n, 2); \\ Michel Marcus, Dec 02 2020

Formula

G.f.: Sum_{k>=1} k^3 * x^k / (1 - x^k)^2.
G.f.: Sum_{k>=1} k * x^k * (1 + 4 * x^k + x^(2*k)) / (1 - x^k)^4.
Dirichlet g.f.: zeta(s - 1) * zeta(s - 3).
Sum_{k=1..n} a(k) ~ zeta(3) * n^4 / 4. - Vaclav Kotesovec, Oct 09 2019
Multiplicative with a(p^e) = (p^(3*e+2) - p^e)/(p^2 - 1). - Amiram Eldar, Dec 02 2020
G.f.: Sum_{n >= 1} q^(n^2)*( n^4 - (2*n^4 - 4*n^3 - 3*n^2 - n)*q^n - (8*n^3 - 4*n)*q^(2*n) + (2*n^4 + 4*n^3 - 3*n^2 + n)*q^(3*n) - n^4*q^(4*n) )/(1 - q^n)^4. Apply the operator x*d/dx twice, followed by the operator q*d/dq once, to equation 5 in Arndt and then set x = 1. - Peter Bala, Jan 21 2021
a(n) = Sum_{k = 1..n} sigma_3( gcd(k, n) ) = Sum_{d divides n} sigma_3(d) * phi(n/d). - Peter Bala, Jan 19 2024
a(n) = Sum_{1 <= i, j, k <= n} sigma_1( gcd(i, j, k, n) ) = Sum_{d divides n} sigma_1(d) * J_3(n/d), where the Jordan totient function J_3(n) = A059376(n). - Peter Bala, Jan 22 2024

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

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    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 *)
  • PARI
    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 */

Formula

Dirichlet g.f.: zeta(s)*zeta(s-1)*zeta(s-4). [corrected by Michael Shamos, May 03 2025]
Multiplicative with a(p^e) = (p^(4e+7) - (p^3+p^2+p+1)*p^(e+1) + p^2+p+1)/(p^7 - (p^3+p^2+p+1)*p + p^2+p+1). - Mitch Harris, Jun 27 2005
L.g.f.: -log(Product_{k>=1} (1 - x^k)^sigma_3(k)) = Sum_{n>=1} a(n)*x^n/n. - Ilya Gutkovskiy, May 23 2018
Sum_{k=1..n} a(k) ~ zeta(5) * Pi^4 * n^5 / 450. - Vaclav Kotesovec, Feb 16 2020, [corrected May 04 2025, according to the corrected DGF]

A288419 a(n) = Sum_{d|n} d^3*A000593(n/d).

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

Views

Author

Seiichi Manyama, Jun 09 2017

Keywords

Comments

Multiplicative because this sequence is the Dirichlet convolution of A000578 and A000593 which are both multiplicative. - Andrew Howroyd, Jul 27 2018

Crossrefs

Sum_{d|n} d^k*A000593(n/d): A288417 (k=0), A109386 (k=1), A288418 (k=2), this sequence (k=3), A288420 (k=4).

Programs

  • Mathematica
    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 *)
  • PARI
    a(n)={sumdiv(n, d, (n/d)^3*sigma(d>>valuation(d,2)))} \\ Andrew Howroyd, Jul 27 2018

Formula

From Amiram Eldar, Nov 13 2022: (Start)
a(n) = A027847(n) for odd n.
Multiplicative with a(2^e) = (8^(e+1)-1)/7 and a(p^e) = (p^(3*e+5) - (p^2+p+1)*p^(e+1) + p + 1)/((p^3-1)*(p^2-1)) for p > 2.
Sum_{k=1..n} a(k) ~ c * n^4, where c = 7*Pi^4*zeta(3)/2880 = (7/32)*zeta(3)*zeta(4) = (7/32) * A183700 = 0.284596... . (End)

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

Views

Author

Seiichi Manyama, Jun 08 2017

Keywords

Crossrefs

Cf. A027847.
Product_{k>=1} (1 - x^k)^sigma_m(k): A288098 (m=0), A288385 (m=1), this sequence (m=2), A288392 (m=3).

Programs

  • Magma
    m:=50; R:=PowerSeriesRing(Rationals(), m); Coefficients(R! ( (&*[(1-q^k)^DivisorSigma(2,k): k in [1..m]]) )); // G. C. Greubel, Oct 30 2018
  • Maple
    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
  • Mathematica
    nmax = 50; CoefficientList[Series[Product[(1-x^k)^DivisorSigma[2, k], {k, 1, nmax}], {x, 0, nmax}], x] (* G. C. Greubel, Oct 30 2018 *)
  • PARI
    m=50; x='x+O('x^m); Vec(prod(k=1, m, (1-x^k)^sigma(k,2))) \\ G. C. Greubel, Oct 30 2018
    

Formula

Convolution inverse of A275585.
a(0) = 1, a(n) = -(1/n)*Sum_{k=1..n} A027847(k)*a(n-k) for n > 0.
G.f.: exp(-Sum_{k>=1} sigma_3(k)*x^k/(k*(1 - x^k))). - Ilya Gutkovskiy, Oct 29 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

Views

Author

Ilya Gutkovskiy, Oct 28 2018

Keywords

Examples

			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.
		

Crossrefs

Programs

  • Magma
    [&+[d*DivisorSigma(n,d):d in Divisors(n)]:n in [1..18]]; // Marius A. Burtea, Feb 15 2020
  • Maple
    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
  • Mathematica
    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}]
  • PARI
    a(n) = sumdiv(n, d, d*sigma(d, n)); \\ Michel Marcus, Oct 28 2018
    
  • Python
    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
    

Formula

a(n) = n * [x^n] -log(Product_{k>=1} (1 - x^k)^sigma_n(k)).
a(n) = Sum_{d|n} d^(n+1)*sigma_1(n/d).
a(n) ~ n^(n+1). - Vaclav Kotesovec, Feb 16 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

Views

Author

Ilya Gutkovskiy, Nov 26 2018

Keywords

Examples

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

Crossrefs

Columns k=0..3 give A060640, A001001, A027847, A027848.
Cf. A109974, A320940 (diagonal), A321876, A322103.

Programs

  • Mathematica
    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
  • PARI
    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

Formula

G.f. of column k: Sum_{j>=1} j*sigma_k(j)*x^j/(1 - x^j).
L.g.f. of column k: -log(Product_{j>=1} (1 - x^j)^sigma_k(j)).
A(n,k) = Sum_{d|n} d^(k+1)*sigma_1(n/d).

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

Views

Author

Wesley Ivan Hurt, May 28 2021

Keywords

Comments

If p is prime, a(p) = p * Sum_{d|p} sigma_d(d) / d = p * (1 + (1^p + p^p)/p) = 1 + p + p^p.

Examples

			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.
		

Crossrefs

Programs

  • Mathematica
    Table[n*Sum[DivisorSigma[k, k] (1 - Ceiling[n/k] + Floor[n/k])/k, {k, n}], {n, 20}]
  • PARI
    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

Formula

G.f.: Sum_{k>=1} sigma_k(k) * x^k/(1 - x^k)^2. - Seiichi Manyama, Dec 16 2022
Showing 1-8 of 8 results.