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 A321645 #5 Nov 15 2018 21:11:34
%S A321645 1,1,3,11,32,96,290,864,2502,7134,20081
%N A321645 Number of distinct row/column permutations of plane partitions of n.
%e A321645 The a(3) = 11 permutations of plane partitions:
%e A321645 [3] [2 1] [1 2] [1 1 1]
%e A321645 .
%e A321645 [2] [1 1] [1 1] [1] [1 0] [0 1]
%e A321645 [1] [1 0] [0 1] [2] [1 1] [1 1]
%e A321645 .
%e A321645 [1]
%e A321645 [1]
%e A321645 [1]
%t A321645 submultisetQ[M_,N_]:=Or[Length[M]==0,MatchQ[{Sort[List@@M],Sort[List@@N]},{{x_,Z___},{___,x_,W___}}/;submultisetQ[{Z},{W}]]];
%t A321645 multsubs[set_,k_]:=If[k==0,{{}},Join@@Table[Prepend[#,set[[i]]]&/@multsubs[Drop[set,i-1],k-1],{i,Length[set]}]];
%t A321645 Table[Length[Select[multsubs[Tuples[Range[n],2],n],And[Union[First/@#]==Range[Max@@First/@#],Union[Last/@#]==Range[Max@@Last/@#],OrderedQ[Sort[Map[Last,GatherBy[Sort[Reverse/@#],First],{2}],submultisetQ],submultisetQ],OrderedQ[Sort[Sort/@Map[Last,GatherBy[#,First],{2}],submultisetQ],submultisetQ]]&]],{n,6}]
%Y A321645 Cf. A000219, A001970, A007716, A008480, A068313, A114736, A120733, A316983, A319646.
%Y A321645 Cf. A321646, A321647, A321648, A321652, A321653, A321655.
%K A321645 nonn,more
%O A321645 0,3
%A A321645 _Gus Wiseman_, Nov 15 2018