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.

A159383 Number of n X n arrays of squares of integers summing to 11.

Original entry on oeis.org

12, 1584, 152688, 13648200, 846679356, 32762864904, 779081474880, 12381739674840, 143119261158300, 1283949949655736, 9379210663695600, 57819891720389760, 309087991429311276, 1463326913027026800
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 G.f.: -12*x^2*(1+x)*(1 + 108*x + 9833*x^2 + 866490*x^3 + 46525328*x^4 + 1327261872*x^5 + 16745609840*x^6 + 97277340534*x^7 + 275802359702*x^8 + 390874554984*x^9 + 275802359702*x^10 + 97277340534*x^11 + 16745609840*x^12 + 1327261872*x^13 + 46525328*x^14 + 866490*x^15 + 9833*x^16 + 108*x^17 + x^18)/(-1+x)^23. - Vaclav Kotesovec, Nov 30 2012