Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #18 Nov 20 2023 00:03:56
%S 190,198,210,222,231,238,246,255,270,282,286,290,294,302,303,306,310,
%T 315,318,326,330,334,335,338,342,345,350,351,354,357,358,363,366,369,
%U 370,374,375,378,381,382,385,386,387,390,393,394,398,399,402,405,406,407,410,411
%N Numbers that are the sum of 4 distinct nonzero squares in 7 or more ways.
%H Robert Israel, <a href="/A025391/b025391.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F {n: A025443(n) >= 7}. - _R. J. Mathar_, Jun 15 2018
%p N:= 1000: # for terms <= N
%p G:= mul(1+x^(i^2)*y, i=1..floor(sqrt(N))):
%p G4:= series(coeff(G,y,4),x,N+1):
%p A:= select(t -> coeff(G4,x,t) >= 7, [$1..N]); # _Robert Israel_, Nov 19 2023
%t With[{nn=25},Select[Select[Tally[Total/@Subsets[Range[nn]^2,{4}]],#[[2]]> 6&][[All,1]]//Union,#<=(nn^2-14)&]] (* _Harvey P. Dale_, Jun 21 2021 *)
%Y Cf. A025372.
%K nonn
%O 1,1
%A _David W. Wilson_