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 A339365 #5 Dec 02 2020 01:01:00
%S A339365 0,1,0,1,1,1,1,1,1,3,1,3,2,3,3,3,4,5,4,6,5,7,7,7,8,10,9,12,10,14,13,
%T A339365 14,15,18,17,21,20,24,24,25,27,31,30,35,34,40,40,42,45,50,50,56,55,64,
%U A339365 65,68,72,78,79,88,85,99,99,105,110,118,122,131,132,146,149
%N A339365 Number of partitions of n into an odd number of squares.
%H A339365 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%H A339365 <a href="/index/Su#ssq">Index entries for sequences related to sums of squares</a>
%F A339365 G.f.: (1/2) * (Product_{k>=1} 1 / (1 - x^(k^2)) - Product_{k>=1} 1 / (1 + x^(k^2))).
%F A339365 a(n) = (A001156(n) - A292520(n)) / 2.
%e A339365 a(9) = 3 because we have [9], [4, 4, 1] and [1, 1, 1, 1, 1, 1, 1, 1, 1].
%t A339365 nmax = 70; CoefficientList[Series[(1/2) (Product[1/(1 - x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}] - Product[1/(1 + x^(k^2)), {k, 1, Floor[nmax^(1/2)] + 1}]), {x, 0, nmax}], x]
%Y A339365 Cf. A000290, A001156, A027193, A292520, A339364, A339366, A339367.
%K A339365 nonn
%O A339365 0,10
%A A339365 _Ilya Gutkovskiy_, Dec 01 2020