Number of connected cubic graphs on 2n unlabeled vertices rooted at a pair of indistinguishable vertices.
A361408
Number of connected cubic graphs on 2n unlabeled vertices rooted at a pair of indistinguishable vertices.
Terms
- a(0) =0a(1) =1a(2) =5a(3) =31a(4) =248a(5) =2382a(6) =27233a(7) =359800a(8) =5364193a(9) =88622485a(10) =1602171855a(11) =31410476113a(12) =663240471075
External references
- oeis: A361408