OFFSET
2,2
COMMENTS
Here the volume is relative to the unit cell of the lattice which is the intersection of Z^n with the hyperplane spanning the polytope.
a(n) is the number of subgraphs of the complete bipartite graph K_{n-1,n} such that for any vertex from the 2nd part there is a matching that covers all other vertices; Postnikov calls the characterization of such subgraphs "the dragon marriage problem".
LINKS
Alexander Postnikov, Permutohedra, Associahedra, and Beyond, International Mathematics Research Notices, 2009, 1026-1106; arXiv:math/0507163 [math.CO], 2005. See Example 5.5.
MATHEMATICA
a[n_] := Sum[(p.(2^Range[0, n-1]))^(n-1) / Times @@ Differences[p], {p, Permutations@Range@n}];
Table[a[n], {n, 2, 8}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Andrey Zabolotskiy, Mar 22 2021
STATUS
approved