|
%I #31 Nov 05 2019 00:59:44
%S 1,1,2,3,5,7,11,14,20,25,33,39,51,58,72,82,99,110,131,143,168,183,210,
%T 226,259,277,312,333,372,394,439,462,511,537,588,617,675,705,765,798,
%U 864,898,970,1005,1081,1121,1199,1240,1326,1369,1459,1505,1599,1646
%N Number of partitions of n avoiding the partition (4,3).
%C We say a partition alpha contains mu provided that one can delete rows and columns from (the Ferrers board of) alpha and then top/right justify to obtain mu. If this is not possible then we say alpha avoids mu. For example the only partitions avoiding (2,1) are those whose Ferrers boards are rectangles.
%H Jonathan Bloom, Nathan McNew, <a href="https://arxiv.org/abs/1908.03953">Counting pattern-avoiding integer partitions</a>, arXiv:1908.03953 [math.CO], 2019.
%H J. Bloom and D. Saracino, <a href="https://arxiv.org/abs/1808.04221">On Criteria for rook equivalence of Ferrers boards</a>, arXiv:1808.04221 [math.CO], 2018.
%H J. Bloom and D. Saracino, <a href="https://arxiv.org/abs/1808.04238">Rook and Wilf equivalence of integer partitions</a>, arXiv:1808.04238 [math.CO], 2018.
%H J. Bloom and D. Saracino, <a href="https://doi.org/10.1016/j.ejc.2018.04.002">Rook and Wilf equivalence of integer partitions</a>, European J. Combin., 71 (2018), 246-267.
%H J. Bloom and D. Saracino, <a href="https://doi.org/10.1016/j.ejc.2018.08.006">On Criteria for rook equivalence of Ferrers boards</a>, European J. Combin., 76 (2018), 199-207.
%Y Cf. A309097, A309099, A309058.
%K nonn
%O 0,3
%A _Jonathan S. Bloom_, Jul 12 2019
%E More terms from _Alois P. Heinz_, Jul 12 2019
|
