The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A323435 Number of rectangular plane partitions of n with no repeated rows or columns. 4
 1, 1, 1, 3, 3, 6, 8, 13, 15, 28, 33, 52, 69, 101, 133, 202, 256, 369, 506, 688, 935, 1295, 1736, 2355, 3184, 4284, 5745, 7722, 10281, 13691, 18316, 24168, 32058, 42389, 55915, 73542, 96753, 126709, 166079, 217017, 283258 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS Number of ways to fill a (not necessarily square) matrix with the parts of an integer partition of n so that the rows and columns are weakly decreasing and with no repeated rows or columns. LINKS Table of n, a(n) for n=0..40. EXAMPLE The a(7) = 13 plane partitions: [7] [4 3] [5 2] [6 1] [4 2 1] . [6] [5] [3 2] [4 1] [4] [2 2] [3 1] [1] [2] [1 1] [1 1] [3] [2 1] [2 1] . [4] [2] [1] MATHEMATICA Table[Sum[Length[Select[Union[Tuples[IntegerPartitions[#, {k}]&/@ptn]], And[UnsameQ@@#, UnsameQ@@Transpose[#], And@@(OrderedQ[#, GreaterEqual]&/@Transpose[#])]&]], {ptn, IntegerPartitions[n]}, {k, Min[ptn]}], {n, 20}] CROSSREFS Cf. A000219, A003293, A047966, A101509, A114736, A117433, A299968, A319066. Cf. A323301, A323307, A323429, A323430, A323431, A323432, A323436, A323438. Sequence in context: A280197 A333526 A097307 * A026804 A240213 A205970 Adjacent sequences: A323432 A323433 A323434 * A323436 A323437 A323438 KEYWORD nonn AUTHOR Gus Wiseman, Jan 15 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 22 21:44 EDT 2024. Contains 371906 sequences. (Running on oeis4.)