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.

A309194 Number of partitions of n avoiding the partition (4,3,2).

Original entry on oeis.org

1, 1, 2, 3, 5, 7, 11, 15, 22, 29, 40, 51, 67, 82, 105, 125, 154, 180, 218, 250, 295, 334, 390, 436, 502, 553, 630, 694, 780, 849, 950, 1027, 1138, 1230, 1355, 1447, 1590, 1694, 1846, 1971, 2133, 2257, 2445, 2579, 2776, 2932, 3142, 3298, 3539, 3702, 3941, 4139
Offset: 0

Views

Author

Jonathan S. Bloom, Jul 16 2019

Keywords

Comments

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.

Crossrefs

Extensions

More terms from Alois P. Heinz, Jul 18 2019