21476700

Appears in sequences

• Consider all complete bipartite graphs on 2n nodes and all possible assignment of weights w(i) (for nodes i=1,...,2n); sequence gives maximal number of ways to orient the edges of the graph so that each node i has w(i) edges oriented towards it (for i=1,...,2n).at n=12A014627