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.
%I A323435 #5 Jan 15 2019 18:45:36
%S A323435 1,1,1,3,3,6,8,13,15,28,33,52,69,101,133,202,256,369,506,688,935,1295,
%T A323435 1736,2355,3184,4284,5745,7722,10281,13691,18316,24168,32058,42389,
%U A323435 55915,73542,96753,126709,166079,217017,283258
%N A323435 Number of rectangular plane partitions of n with no repeated rows or columns.
%C A323435 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.
%e A323435 The a(7) = 13 plane partitions:
%e A323435 [7] [4 3] [5 2] [6 1] [4 2 1]
%e A323435 .
%e A323435 [6] [5] [3 2] [4 1] [4] [2 2] [3 1]
%e A323435 [1] [2] [1 1] [1 1] [3] [2 1] [2 1]
%e A323435 .
%e A323435 [4]
%e A323435 [2]
%e A323435 [1]
%t A323435 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}]
%Y A323435 Cf. A000219, A003293, A047966, A101509, A114736, A117433, A299968, A319066.
%Y A323435 Cf. A323301, A323307, A323429, A323430, A323431, A323432, A323436, A323438.
%K A323435 nonn
%O A323435 0,4
%A A323435 _Gus Wiseman_, Jan 15 2019