Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph with a perfect matching removed using exactly k interchangeable colors, for n >= 1 and 2 <= k <= 2n.
A385437
Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph with a perfect matching removed using exactly k interchangeable colors, for n >= 1 and 2 <= k <= 2n.
Terms
- a(0) =1a(1) =2a(2) =4a(3) =1a(4) =1a(5) =10a(6) =20a(7) =9a(8) =1a(9) =1a(10) =18a(11) =92a(12) =146a(13) =80a(14) =16a(15) =1a(16) =1a(17) =35a(18) =355a(19) =1146a(20) =1492a(21) =850a(22) =220a(23) =25a(24) =1a(25) =1a(26) =68a(27) =1336a(28) =7590a(29) =17831
External references
- oeis: A385437