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.

A115725 Number of partitions with maximum rectangle <= n.

Original entry on oeis.org

1, 2, 5, 10, 26, 42, 118, 171, 389, 692, 1442, 1854, 5534, 6895, 11910, 21116, 44278, 52568, 118734, 138670, 300326, 492507, 728514, 829244, 2167430, 2987124, 4167602, 6092588, 11308432, 12554900, 29925267, 33023589, 57950313, 81424281, 106214784, 148101088
Offset: 0

Views

Author

Keywords

Comments

A partition has maximum rectangle <= n iff it is a subpartition of row n of A010766.

Examples

			The 10 partitions with maximum rectangle <= 3: 0: []; 1: [1]; 2: [2], [1^2], [2,1]; 3: [3], [1^3], [3,1], [2,1^2], [3,1^2].
		

Crossrefs

Formula

a(n) = subpart([A115728 (or A115729), [] is row n of A010766.
a(n) = Sum_{k>=0} A182114(k,n). - Alois P. Heinz, Nov 02 2012