The number of connected, unlabeled, undirected, edge-signed cubic graphs (admitting loops and multiedges) on 2n vertices where the degree of the first sign is 2 at each node.
A323389
The number of connected, unlabeled, undirected, edge-signed cubic graphs (admitting loops and multiedges) on 2n vertices where the degree of the first sign is 2 at each node.
Terms
- a(0) =1a(1) =2a(2) =5a(3) =19a(4) =88a(5) =553a(6) =4619a(7) =49137a(8) =646815a(9) =10053183a(10) =178725865a(11) =3555840644a(12) =78048875298
External references
- oeis: A323389