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 A025380 #16 Nov 20 2023 00:03:53
%S A025380 126,150,170,186,219,225,230,242,249,250,261,267,274,275,278,287,295,
%T A025380 297,305,311,314,319,321,322,323,325,343,346,347,361,377,379,383,401,
%U A025380 419,421,427,437,457,463,467,468,493,500,504,509,517,523,524,577,600,680,724,744
%N A025380 Numbers that are the sum of 4 distinct nonzero squares in exactly 5 ways.
%H A025380 Robert Israel, <a href="/A025380/b025380.txt">Table of n, a(n) for n = 1..114</a>
%H A025380 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F A025380 {n: A025443(n) = 5}. - _R. J. Mathar_, Jun 15 2018
%p A025380 N:= 100000: # for terms <= N
%p A025380 G:= mul(1+x^(i^2)*y, i=1..floor(sqrt(N))):
%p A025380 G4:= series(coeff(G,y,4),x,N+1):
%p A025380 select(t -> coeff(G4,x,t) = 5, [$1..N]): # _Robert Israel_, Nov 19 2023
%Y A025380 Cf. A025389, A025361.
%K A025380 nonn
%O A025380 1,1
%A A025380 _David W. Wilson_