Number of ways to fill a Young diagram with positive integers summing to n such that all rows and columns are strictly increasing.

A323451

Number of ways to fill a Young diagram with positive integers summing to n such that all rows and columns are strictly increasing.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =3a(4) =3a(5) =6a(6) =9a(7) =12a(8) =19a(9) =27a(10) =39a(11) =54a(12) =79a(13) =107a(14) =150a(15) =209a(16) =282a(17) =387a(18) =525a(19) =707a(20) =949a(21) =1272a(22) =1688a(23) =2244a(24) =2968a(25) =3902a(26) =5125a(27) =6712a(28) =8752a(29) =11383

External references