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.

A351805 a(n) = Sum_{1 <= i < j <= n} j^5*i^5.

Original entry on oeis.org

0, 0, 32, 8051, 290675, 4353175, 38761975, 243824182, 1194358326, 4842169350, 16924669350, 52488756425, 147511725257, 381689190701, 920589376525, 2089893985900, 4500779925100, 9254143113132, 18262909865676, 34746798604575, 63973358604575, 114343801467875
Offset: 0

Views

Author

Roudy El Haddad, Feb 19 2022

Keywords

Comments

a(n) is the sum of all products of two distinct elements from the set {1^5, ..., n^5}.

Crossrefs

Cf. A000217 (for power 0), A000914 (for power 1), A000596 (for squares), A347107 (for cubes), (for fourth powers).
Cf. A000584 (fifth powers), A000539 (sum of fifth powers).

Programs

  • PARI
    {a(n) = n*(n-1)*(n+1)*(44*n^9+120*n^8-132*n^7-540*n^6+99*n^5+912*n^4-11*n^3-672*n^2+120)/3168};

Formula

a(n) = Sum_{j=2..n} Sum_{i=1..j-1} j^5*i^5.
a(n) = n*(n - 1)*(n + 1)*(44*n^9 + 120*n^8 - 132*n^7 - 540*n^6 + 99*n^5 + 912*n^4 - 11*n^3 - 672*n^2 + 120)/3168.
G.f.: -x^2*(x^9 +1044*x^8 +54462*x^7 +595860*x^6 +2048388*x^5 +2563644*x^4 +1193226*x^3 +188508*x^2 +7635*x +32)/(x-1)^13. - Alois P. Heinz, Feb 19 2022