Triangle read by rows: T(n,k) = number of specially labeled bicolored connected graphs with k points in one color class and n-k points in the other class . "Special" means there are separate labels 1,2, ...,k and 1,2, ...,n-k for the two color classes (n >= 1, k = floor((n+1)/2), ..., n).
A123260
Triangle read by rows: T(n,k) = number of specially labeled bicolored connected graphs with k points in one color class and n-k points in the other class . "Special" means there are separate labels 1,2, ...,k and 1,2, ...,n-k for the two color classes (n >= 1, k = floor((n+1)/2), ..., n).
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =0a(5) =5a(6) =1a(7) =0a(8) =19a(9) =1a(10) =0a(11) =205a(12) =65a(13) =1a(14) =0a(15) =1795a(16) =211a(17) =1a(18) =0a(19) =36317a(20) =14221a(21) =665a(22) =1a(23) =0a(24) =636331a(25) =106819a(26) =2059a(27) =1a(28) =0a(29) =23679901
External references
- oeis: A123260