Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Oct 23 2017 16:52:45
%S 1,0,0,0,0,0,0,0,1,0,1,1,1,2,3,0,5,5,2,7,5,1,11,14,6,9,20,5,18,33,5,
%T 43,50,12,58,17,16,91,96,26,58,146,23,183,148,11,241,285,88,187,152,
%U 98,367,537,87,177,376,179,857,983,77,1195,1274,79,1596,468,290,2117,1887,549,460,3064,440
%N Number of partitions of n into odd parts that do not divide n.
%H <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%e a(13) = 2 because we have [7, 3, 3] and [5, 5, 3].
%t Table[SeriesCoefficient[Product[1/(1 - Boole[Mod[n, k] > 0 && OddQ[k]] x^k), {k, 1, n}], {x, 0, n}], {n, 0, 72}]
%Y Cf. A000009, A098743, A128515, A171565, A200745, A294142.
%K nonn
%O 0,14
%A _Ilya Gutkovskiy_, Oct 23 2017