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 A282207 #4 Feb 10 2017 01:10:48
%S A282207 1,1,0,3,3,5,5,7,22,24,30,32,73,75,91,198,277,309,339,560,689,1078,
%T A282207 1126,1567,2703,3396,3676,5086,7046,8241,10896,13072,19891,22975,
%U A282207 27922,41597,56117,62459,77183,100793,131846,161665,191446,255225,311247,408418,467460,599970,843441
%N A282207 Expansion of Product_{k>=0} (1 + (2*k + 1)*x^(2*k+1)).
%C A282207 Sum of products of terms in all partitions of n into distinct odd parts.
%H A282207 <a href="/index/Par#partN">Index entries for related partition-counting sequences</a>
%F A282207 G.f.: Product_{k>=0} (1 + (2*k + 1)*x^(2*k+1)).
%e A282207 a(10) = 30 because we have [9, 1], [7, 3], 9*1 = 9, 7*3 = 21 and 9 + 21 = 30.
%t A282207 nmax = 48; CoefficientList[Series[Product[1 + (2 k + 1) x^(2 k + 1), {k, 0, nmax}], {x, 0, nmax}], x]
%Y A282207 Cf. A000700, A022629, A067553.
%K A282207 nonn
%O A282207 0,4
%A A282207 _Ilya Gutkovskiy_, Feb 09 2017