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.
%I A159371 #10 Jun 02 2025 01:32:53 %S A159371 6,675,34830,1347525,32145930,460513662,4464289944,32292364770, %T A159371 186464336850,900743450145,3764484413118,13954005203463, %U A159371 46750424936670,143665627355100,409707743053920,1094582930018724,2760817157366382 %N A159371 Number of n X n arrays of squares of integers summing to 8. %C A159371 All such sequences have holonomic recurrences (cf. comment in A159359). - _Georg Fischer_, Feb 17 2022 %H A159371 R. H. Hardin, <a href="/A159371/b159371.txt">Table of n, a(n) for n=2..100</a> %H A159371 <a href="/index/Rec#order_17">Index entries for linear recurrences with constant coefficients</a>, signature (17, -136, 680, -2380, 6188, -12376, 19448, -24310, 24310, -19448, 12376, -6188, 2380, -680, 136, -17, 1). %F A159371 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] %K A159371 nonn %O A159371 2,1 %A A159371 _R. H. Hardin_ Apr 11 2009