Number of proper vertex colorings of the n-complete bipartite graph using exactly 5 interchangeable colors.
A384981
Number of proper vertex colorings of the n-complete bipartite graph using exactly 5 interchangeable colors.
Terms
- a(0) =0a(1) =0a(2) =6a(3) =86a(4) =770a(5) =5710a(6) =38626a(7) =248766a(8) =1558290a(9) =9603470a(10) =58604546a(11) =355460446a(12) =2147773810a(13) =12945690030a(14) =77907271266a(15) =468366848126
External references
- oeis: A384981