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 A339366 #5 Dec 02 2020 01:01:06
%S A339366 1,0,0,0,0,1,0,0,0,0,1,0,0,1,0,0,0,1,0,0,1,0,0,0,0,1,1,0,0,1,1,0,0,0,
%T A339366 1,0,0,1,0,1,1,1,0,0,0,1,1,0,0,0,2,1,1,1,1,0,0,1,1,0,0,1,1,1,0,3,1,0,
%U A339366 1,0,1,1,0,1,2,1,0,0,3,1,1,1,1,0,1,3,1,1,0,1,3
%N A339366 Number of partitions of n into an even number of distinct squares.
%H A339366 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%H A339366 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F A339366 G.f.: (1/2) * (Product_{k>=1} (1 + x^(k^2)) + Product_{k>=1} (1 - x^(k^2))).
%F A339366 a(n) = (A033461(n) + A276516(n)) / 2.
%e A339366 a(50) = 2 because we have [49, 1] and [36, 9, 4, 1].
%t A339366 nmax = 90; CoefficientList[Series[(1/2) (Product[(1 + x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}] + Product[(1 - x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}]), {x, 0, nmax}], x]
%Y A339366 Cf. A000290, A033461, A067661, A276516, A339364, A339365, A339367.
%K A339366 nonn
%O A339366 0,51
%A A339366 _Ilya Gutkovskiy_, Dec 01 2020