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