cp's OEIS Frontend

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.

A294141 Number of partitions of n into odd parts that do not divide n.

This page as a plain text file.
%I A294141 #5 Oct 23 2017 16:52:45
%S A294141 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 A294141 43,50,12,58,17,16,91,96,26,58,146,23,183,148,11,241,285,88,187,152,
%U A294141 98,367,537,87,177,376,179,857,983,77,1195,1274,79,1596,468,290,2117,1887,549,460,3064,440
%N A294141 Number of partitions of n into odd parts that do not divide n.
%H A294141 <a href="/index/Par#part">Index entries for sequences related to partitions</a>
%e A294141 a(13) = 2 because we have [7, 3, 3] and [5, 5, 3].
%t A294141 Table[SeriesCoefficient[Product[1/(1 - Boole[Mod[n, k] > 0 && OddQ[k]] x^k), {k, 1, n}], {x, 0, n}], {n, 0, 72}]
%Y A294141 Cf. A000009, A098743, A128515, A171565, A200745, A294142.
%K A294141 nonn
%O A294141 0,14
%A A294141 _Ilya Gutkovskiy_, Oct 23 2017