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 A258586 #13 Jul 19 2017 20:08:03
%S A258586 1,2,936,1825221320,70351928759681296000,
%T A258586 160978956785364112335731878007698260,
%U A258586 51488321677815455036453939239317069333712945710369620220,4648889159675386017282064494039528050991187044317172798976485350954735075040045120
%N A258586 Number of solid standard Young tableaux of shape [[{n}^(n+1)],[n]^n].
%H A258586 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 A258586 Wikipedia, <a href="https://en.wikipedia.org/wiki/Young_tableau">Young tableau</a>
%p A258586 b:= proc(l) option remember; local m; m:= nops(l);
%p A258586 `if`({map(x-> x[], l)[]}={0}, 1, add(add(`if`(l[i][j]>
%p A258586 `if`(i=m or nops(l[i+1])<j, 0, l[i+1][j]) and l[i][j]>
%p A258586 `if`(nops(l[i])=j, 0, l[i][j+1]), b(subsop(i=subsop(
%p A258586 j=l[i][j]-1, l[i]), l)), 0), j=1..nops(l[i])), i=1..m))
%p A258586 end:
%p A258586 a:= n-> b([[n$(n+1)], [n]$n]):
%p A258586 seq(a(n), n=0..5);
%Y A258586 Cf. A214722, A258583.
%K A258586 nonn
%O A258586 0,2
%A A258586 _Alois P. Heinz_, Nov 06 2015