Triangle read by rows: T(n,k) is the number of bicolored cubic graphs on 2n unlabeled vertices with k vertices of the first color, n >= 0, 0 <= k <= 2*n.
A361361
Triangle read by rows: T(n,k) is the number of bicolored cubic graphs on 2n unlabeled vertices with k vertices of the first color, n >= 0, 0 <= k <= 2*n.
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) =6a(17) =11a(18) =33a(19) =48a(20) =66a(21) =48a(22) =33a(23) =11a(24) =6a(25) =21a(26) =68a(27) =257a(28) =556a(29) =950
External references
- oeis: A361361