Triangle T(n,f): the number of bicolored connected cubic graphs on 2n vertices with f vertices of the first color.
A321304
Triangle T(n,f): the number of bicolored connected cubic graphs on 2n vertices with f vertices of the first color.
Terms
- a(0) =1a(1) =0a(2) =0a(3) =0a(4) =1a(5) =1a(6) =1a(7) =1a(8) =1a(9) =2a(10) =2a(11) =5a(12) =5a(13) =5a(14) =2a(15) =2a(16) =5a(17) =10a(18) =31a(19) =46a(20) =63a(21) =46a(22) =31a(23) =10a(24) =5a(25) =19a(26) =64a(27) =248a(28) =542a(29) =931
External references
- oeis: A321304