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 A236691 #17 Feb 09 2023 22:09:04
%S A236691 1,2,6,32,352,9304,683464,161960220
%N A236691 Number of totally symmetric solid partitions which fit in an n X n X n X n box.
%C A236691 Also, for n > 0, the number of totally symmetric (n-1)-dimensional partitions which fit in an (n-1)-dimensional box whose sides all have length 5.
%C A236691 There is no conjectured formula for a(n).
%C A236691 The formula a(n,d) = Product_{i_1=1..n} Product_{i_2=i_1..n} ... Product_{i_d=i_(d-1)..n} (i_1+i_2+...+i_d-d+2)/(i_1+i_2+...+i_d-d+1) gives the number of totally symmetric d-dimensional partitions that fit in a box whose sides all have length n, for d = 1, 2, and 3. For d > 3 this formula fails. In particular, when d=4 it produces the sequence: 1, 2, 6, 32, 352, 9216, 661504, ... rather than the sequence above.
%H A236691 Seth Ireland, <a href="https://arxiv.org/abs/2302.02505">A bijection between strongly stable and totally symmetric partitions</a>, arXiv:2302.02505 [math.CO], 2023.
%Y A236691 This is the 4-dimensional case. Dimensions 1, 2, and 3 are respectively given by A000027, A000079, and A005157.
%Y A236691 Cf. A097516.
%K A236691 nonn,hard,more
%O A236691 0,2
%A A236691 _Graham H. Hawkes_, Jan 30 2014