Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph using exactly k interchangeable colors, 2 <= k <= 2*n.
A384968
Triangle read by rows: T(n,k) is the number of proper vertex colorings of the n-complete bipartite graph using exactly k interchangeable colors, 2 <= k <= 2*n.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =1a(5) =6a(6) =11a(7) =6a(8) =1a(9) =1a(10) =14a(11) =61a(12) =86a(13) =50a(14) =12a(15) =1a(16) =1a(17) =30a(18) =275a(19) =770a(20) =927a(21) =530a(22) =150a(23) =20a(24) =1a(25) =1a(26) =62a(27) =1141a(28) =5710a(29) =12160
External references
- oeis: A384968