Number of connected 3-regular multigraphs on 2n unlabeled nodes rooted at an oriented edge (or loop) whose removal does not disconnect the graph, loops allowed.

A361448

Number of connected 3-regular multigraphs on 2n unlabeled nodes rooted at an oriented edge (or loop) whose removal does not disconnect the graph, loops allowed.

Terms

    a(0) =1a(1) =2a(2) =10a(3) =66a(4) =511a(5) =4536a(6) =45519a(7) =512661a(8) =6436571a(9) =89505875a(10) =1369509795a(11) =22908806774a(12) =416408493351

External references