|
|
A229865
|
|
Number of n X n 0..1 arrays with corresponding row and column sums equal.
|
|
9
|
|
|
1, 2, 8, 80, 2432, 247552, 88060928, 112371410944, 523858015518720, 9041009511609073664, 583447777113052431515648, 141885584718620229407228821504, 130832005909904417592540055577034752, 459749137931232137234615429529864283095040, 6182706200522446492946534924719926752508110700544
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Also known as labeled Eulerian digraphs allowing loops. - Brendan McKay, May 12 2019
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Some solutions for n=4:
0 0 0 1 0 0 1 0 0 0 0 1 0 0 1 0 0 0 1 1
0 1 0 0 1 0 0 0 1 0 1 0 0 0 1 1 1 0 0 1
0 0 0 1 0 1 0 0 0 1 0 1 0 1 1 1 1 1 1 0
1 0 1 0 0 0 0 1 0 1 1 0 1 1 0 0 0 1 1 1
The a(3) = 8 Eulerian digraph edge-sets:
{}
{11}
{22}
{11,22}
{12,21}
{11,12,21}
{12,21,22}
{11,12,21,22}
(End)
|
|
MATHEMATICA
|
Table[Length[Select[Subsets[Tuples[Range[n], 2]], Sort[First/@#]==Sort[Last/@#]&]], {n, 4}] (* Gus Wiseman, Jun 22 2019 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|