A385321 Number of 3-dimensional permutation arrays of size n X n X n.
1, 5, 70, 2167, 130708, 14231289, 2664334184, 831478035698
Offset: 1
Examples
For n=2, the three flags must agree on the two dimensional part. The one-dimensional part either agrees or disagrees which give five possibilities corresponding to the five set partitions of three elements.
Links
- Kimmo Eriksson and Svante Linusson, A combinatorial theory of higher-dimensional permutation arrays, Adv. Appl. Math. 25(2) (2000a), 194-211. See Table 1 (p. 210).
Crossrefs
Column 3 of A330490.
Comments