

A109542


a(n) = number of labeled 3regular (trivalent) multigraphs without selfloops on 2n vertices with a maximum of 2 edges between any pair of nodes. Also a(n) = number of labeled symmetric 2n X 2n matrices with {0,1,2}entries with row sum equal to 3 for each row and trace 0.


0





