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-2 of 2 results.

A069153 a(n) = Sum_{d|n} d*(d-1)/2.

Original entry on oeis.org

0, 1, 3, 7, 10, 19, 21, 35, 39, 56, 55, 91, 78, 113, 118, 155, 136, 208, 171, 252, 234, 287, 253, 395, 310, 404, 390, 497, 406, 614, 465, 651, 586, 698, 626, 910, 666, 875, 822, 1060, 820, 1202, 903, 1239, 1144, 1289, 1081, 1643, 1197, 1581, 1414, 1736
Offset: 1

Views

Author

Benoit Cloitre, Apr 08 2002

Keywords

Comments

Inverse Mobius transform of A000217. - R. J. Mathar, Jan 19 2009

Examples

			x^2 + 3*x^3 + 7*x^4 + 10*x^5 + 19*x^6 + 21*x^7 + 35*x^8 + 39*x^9 + 56*x^10 + ...
		

Crossrefs

Programs

  • Maple
    with(numtheory):
    seq((1/2)*(sigma[2](n) - sigma[1](n)), n = 1..100); # Peter Bala, Jan 21 2021
  • Mathematica
    A069153[n_]:=Plus@@Binomial[Divisors[n],2];Array[A069153,100] (* Enrique Pérez Herrero, Feb 21 2012 *)
  • PARI
    {a(n) = if( n<1, 0, sumdiv(n, d, d^2 - d) / 2)}
    
  • PARI
    a(n) = my(f = factor(n)); (sigma(f, 2) - sigma(f)) / 2; \\ Amiram Eldar, Jan 01 2025

Formula

G.f.: Sum_{k>0} x^(2*k)/(1-x^k)^3. - Vladeta Jovovic, Dec 17 2002
Row sums of triangle A134840. - Gary W. Adamson, Nov 12 2007
G.f. A(x) = (1/2) * x * d/dx log( B(x) ) where B() is g.f. for A052847. - Michael Somos, Feb 12 2008
G.f.: Sum_{k>0} ((k^2 - k) / 2) * x^k / (1 - x^k). - Michael Somos, Feb 12 2008
From Peter Bala, Jan 21 2021: (Start)
a(n) = (1/2)*(sigma_2(n) - sigma_1(n)) = (1/2)*(A001157(n) A000203(n)) = (1/2)*A086666.
G.f.: A(x) = (1/2)* Sum_{n >= 1} x^(n^2)*( n*(n-1)*x^(3*n) - (n^2 + n - 2)*x^(2*n) + n*(3 - n)*x^n + n*(n - 1) )/(1 - x^n)^3. - differentiate equation 5 in Arndt twice w.r.t x and set x = 1. (End)
From Amiram Eldar, Jan 01 2025: (Start)
Dirichlet g.f.: zeta(s) * (zeta(s-2) - zeta(s-1)) / 2.
Sum_{k=1..n} a(k) ~ (zeta(3)/6) * n^3. (End)

A379812 a(n) = sigma_1(n) * sigma_2(n).

Original entry on oeis.org

1, 15, 40, 147, 156, 600, 400, 1275, 1183, 2340, 1464, 5880, 2380, 6000, 6240, 10571, 5220, 17745, 7240, 22932, 16000, 21960, 12720, 51000, 20181, 35700, 32800, 58800, 25260, 93600, 30784, 85995, 58560, 78300, 62400, 173901, 52060, 108600, 95200, 198900, 70644
Offset: 1

Views

Author

Amiram Eldar, Jan 03 2025

Keywords

References

  • Srinivasa Ramanujan, Collected papers, edited by G. H. Hardy et al., Chelsea, 1962, chapter 17, pp. 133-135.

Crossrefs

Programs

  • Mathematica
    a[n_] := Times @@ DivisorSigma[{1, 2}, n]; Array[a, 50]
  • PARI
    a(n) = {my(f = factor(n)); sigma(f) * sigma(f, 2);}

Formula

a(n) = A000203(n) * A001157(n).
Multiplicative with a(p^e) = (p^(e+1)-1) * (p^(2*e+2)-1) / ((p-1) * (p^2-1)).
Dirichlet g.f.: zeta(s) * zeta(s-1) * zeta(s-2) * zeta(s-3) / zeta(2*s-3).
In general, Dirichlet g.f. of sigma_i(n) * sigma_j(n): zeta(s) * zeta(s-i) * zeta(s-j) * zeta(s-i-j) / zeta(2*s-i-j) (Ramanujan, 1916).
Sum_{k=1..n} a(k) ~ c * n^4 / 4, where c = zeta(2) * zeta(3) * zeta(4) / zeta(5) = zeta(3) * Pi^6 / (540*zeta(5)) = 2.06386841111121962734... .
In general, Sum_{k=1..n} sigma_i(k) * sigma_j(k) ~ c(i,j) * n^(i+j+1) / (i+j+1), for i, j >= 1, where c(i,j) = zeta(i+1) * zeta(j+1) * zeta(i+j+1) / zeta(i+j+2).
G.f.: Sum_{k>=1} Sum_{l>=1} k*l^2*x^lcm(k, l)/(1 - x^lcm(k, l)). - Miles Wilson, Jul 10 2025
Showing 1-2 of 2 results.