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 A025423 #22 May 18 2025 07:42:55
%S A025423 1,1,1,1,2,2,2,2,3,3,3,3,3,4,4,3,5,5,5,5,6,6,7,6,6,8,8,7,8,10,9,9,10,
%T A025423 9,11,10,11,13,14,11,13,14,13,14,14,16,17,15,14,18,18,16,19,21,23,20,
%U A025423 21,20,23,22,19,26,26,23,25,26,26,27,27,28,34,29,28,31,33,30,32,36,35,36,34,36
%N A025423 Number of partitions of n into 8 squares.
%H A025423 Alois P. Heinz, <a href="/A025423/b025423.txt">Table of n, a(n) for n = 0..10000</a>
%p A025423 b:= proc(n, i, t) option remember; `if`(n=0, 1,
%p A025423 `if`(i<1 or t<1, 0, b(n, i-1, t)+
%p A025423 `if`(i^2>n, 0, b(n-i^2, i, t-1))))
%p A025423 end:
%p A025423 a:= n-> b(n, isqrt(n), 8):
%p A025423 seq(a(n), n=0..120); # _Alois P. Heinz_, May 30 2014
%t A025423 b[n_, i_, t_] := b[n, i, t] = If[n == 0, 1, If[i<1 || t<1, 0, b[n, i-1, t] + If[i^2 > n, 0, b[n-i^2, i, t-1]]]]; a[n_] := b[n, Sqrt[n] // Floor, 8]; Table[a[n], {n, 0, 120}] (* _Jean-François Alcover_, Jun 11 2015, after _Alois P. Heinz_ *)
%t A025423 a[n_]:=Length[PowersRepresentations[n,8,2]]; Array[a,82,0] (* _Stefano Spezia_, May 18 2025 *)
%K A025423 nonn
%O A025423 0,5
%A A025423 _David W. Wilson_