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