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 A299926 #15 Feb 23 2018 22:14:03 %S A299926 1,4,14,60,252,1212,5880,30904,166976,952456,5587840,34217216, %T A299926 215204960,1401551376,9360467760,64384034784,453328282624, %U A299926 3274696185568,24173219998912,182546586425408 %N A299926 a(n) is the number of normal generalized Young tableaux of size n with all rows and columns weakly increasing and all regions skew partitions. %C A299926 If y is an integer partition of n, a generalized Young tableau of shape y is an array obtained by replacing the dots in the Ferrers diagram of y with positive integers. A tableau is normal if its entries span an initial interval of positive integers. %e A299926 The a(3) = 14 tableaux: %e A299926 1 2 3 1 2 2 1 1 2 1 1 1 %e A299926 . %e A299926 1 3 1 2 1 2 1 2 1 1 1 1 %e A299926 2 3 2 1 2 1 %e A299926 . %e A299926 1 1 1 1 %e A299926 2 2 1 1 %e A299926 3 2 2 1 %t A299926 undptns[y_]:=DeleteCases[Select[Tuples[Range[0,#]&/@y],OrderedQ[#,GreaterEqual]&],0,{2}]; %t A299926 chn[y_]:=Join[{{{},y}},Join@@Function[c,Append[#,y]&/@chn[c]]/@Take[undptns[y],{2,-2}]]; %t A299926 Table[Sum[Length[chn[y]],{y,IntegerPartitions[n]}],{n,8}] %Y A299926 Cf. A000085, A063834, A138178, A153452, A296188, A296561, A297388, A299699, A299925. %K A299926 nonn,more %O A299926 1,2 %A A299926 _Gus Wiseman_, Feb 21 2018