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 A214638 #18 Jul 19 2017 19:43:43 %S A214638 1,6,936,379366,249664758,221005209058,239143562020194, %T A214638 299233941746052998,417999868371999142276,636568066798406010872120, %U A214638 1039267652960081699025215774,1796704965351078502372895796786,3258764657213579008313421745034602 %N A214638 Number of solid standard Young tableaux of shape [[n,n,n],[n],[n]]. %H A214638 Alois P. Heinz, <a href="/A214638/b214638.txt">Table of n, a(n) for n = 0..40</a> %H A214638 S. B. Ekhad, D. Zeilberger, <a href="https://arxiv.org/abs/1202.6229">Computational and Theoretical Challenges on Counting Solid Standard Young Tableaux</a>, arXiv:1202.6229v1 [math.CO], 2012 %H A214638 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a> %p A214638 b:= proc(l) option remember; local m; m:= nops(l); %p A214638 `if`({map(x-> x[], l)[]}={0}, 1, add(add(`if`(l[i][j]> %p A214638 `if`(i=m or nops(l[i+1])<j, 0, l[i+1][j]) and l[i][j]> %p A214638 `if`(nops(l[i])=j, 0, l[i][j+1]), b(subsop(i=subsop( %p A214638 j=l[i][j]-1, l[i]), l)), 0), j=1..nops(l[i])), i=1..m)) %p A214638 end: %p A214638 a:= n-> b([[n, n, n], [n], [n]]): %p A214638 seq(a(n), n=0..10); %t A214638 b[l_] := b[l] = With[{m := Length[l]}, If[Union[Flatten[l]] == {0}, 1, Sum[Sum[If[l[[i, j]] > If[i == m || Length[l[[i+1]]] < j, 0, l[[i+1, j]]] && l[[i, j]] > If[Length[l[[i]]] == j, 0, l[[i, j+1]]], b[ReplacePart[l, i -> ReplacePart[l[[i]], j -> l[[i, j]]-1]]], 0], {j, 1, Length[l[[i]]]}], {i, 1, m}]] ]; a[n_] := b[{{n, n, n}, {n}, {n}}]; Table[a[n], {n, 0, 12}] // Flatten (* _Jean-François Alcover_, Dec 18 2013, translated from Maple *) %Y A214638 Cf. A213932, A213978, A214637. %K A214638 nonn %O A214638 0,2 %A A214638 _Alois P. Heinz_, Jul 23 2012