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 A339376 #4 Dec 02 2020 09:01:29
%S A339376 0,1,0,1,0,0,1,0,0,0,2,0,0,0,1,1,0,1,0,2,0,1,1,0,1,1,1,0,3,0,1,1,2,0,
%T A339376 1,2,1,3,0,2,1,2,1,1,2,2,3,1,1,3,2,0,4,3,2,3,2,2,2,3,2,4,2,3,2,3,4,4,
%U A339376 4,1,5,4,2,3,5,3,6,4,2,6,4,3,5,6,5,5,5,5,5,4,5
%N A339376 Number of partitions of n into an odd number of distinct triangular numbers.
%H A339376 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%H A339376 <a href="/index/Pol#polygonal_numbers">Index to sequences related to polygonal numbers</a>
%F A339376 G.f.: (1/2) * (Product_{k>=1} (1 + x^(k*(k + 1)/2)) - Product_{k>=1} (1 - x^(k*(k + 1)/2))).
%F A339376 a(n) = (A024940(n) - A292518(n)) / 2.
%e A339376 a(28) = 3 because we have [28], [21, 6, 1] and [15, 10, 3].
%t A339376 nmax = 90; CoefficientList[Series[(1/2) (Product[(1 + x^(k (k + 1)/2)), {k, 1, nmax}] - Product[(1 - x^(k (k + 1)/2)), {k, 1, nmax}]), {x, 0, nmax}], x]
%Y A339376 Cf. A000217, A024940, A067659, A292518, A339367, A339373, A339374, A339375.
%K A339376 nonn
%O A339376 0,11
%A A339376 _Ilya Gutkovskiy_, Dec 02 2020