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.

A159371 Number of n X n arrays of squares of integers summing to 8.

Original entry on oeis.org

6, 675, 34830, 1347525, 32145930, 460513662, 4464289944, 32292364770, 186464336850, 900743450145, 3764484413118, 13954005203463, 46750424936670, 143665627355100, 409707743053920, 1094582930018724, 2760817157366382
Offset: 2

Views

Author

R. H. Hardin Apr 11 2009

Keywords

Comments

All such sequences have holonomic recurrences (cf. comment in A159359). - Georg Fischer, Feb 17 2022

Formula

Empirical: n^2*(n^2-1)*(n^12-27*n^10+295*n^8+15*n^6-10016*n^4+35652*^2-15120)/40320. [From R. J. Mathar, Aug 11 2009]