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

A354021 a(n) = Sum_{1 <= i < j < k < m <= n} (m*k*j*i)^2.

Original entry on oeis.org

0, 0, 0, 0, 576, 21076, 296296, 2475473, 14739153, 68943381, 268880381, 909450751, 2742417535, 7522650135, 19058554515, 45123156390, 100771975590, 213877057086, 434042943246, 846542846578, 1593528150578
Offset: 0

Views

Author

Roudy El Haddad, May 14 2022

Keywords

Comments

a(n) is the sum of all products of four distinct squares of positive integers up to n, i.e., the sum of all products of four distinct elements from the set of squares {1^2, ..., n^2}.

Crossrefs

Cf. A353021 (for nondistinct squares).
Cf. A000290 (squares), A000330 (sum of squares), A000596 (for two squares), A000597 (for three squares).
Cf. A001298 (for power 1).

Programs

  • PARI
    {a(n) = n*(n + 1)*(n - 1)*(n - 2)*(n - 3)*(2*n + 1)*(2*n - 1)*(2*n - 3)*(2*n - 5)*(5*n + 7)*(35*n^2 + 98*n + 72)/5443200};

Formula

a(n) = Sum_{m=4..n} Sum_{k=3..m-1} Sum_{j=2..k-1} Sum_{i=1..j-1} (m*k*j*i)^2.
a(n) = n*(n+1)*(n-1)*(n-2)*(n-3)*(2*n + 1)*(2*n - 1)*(2*n - 3)*(2*n - 5)*(5*n + 7)*(35*n^2 + 98*n + 72)/5443200.
a(n) = binomial(2*n+2,9)*(5*n + 7)*(35*n^2 + 98*n + 72)/(5!*4).
Showing 1-1 of 1 results.