Array read by antidiagonals: T(n,k) is the number of graphs on n labeled nodes, each node being colored with one of k colors, where no edge connects two nodes of the same color.
A322280
Array read by antidiagonals: T(n,k) is the number of graphs on n labeled nodes, each node being colored with one of k colors, where no edge connects two nodes of the same color.
Terms
- a(0) =1a(1) =1a(2) =0a(3) =1a(4) =1a(5) =0a(6) =1a(7) =2a(8) =1a(9) =0a(10) =1a(11) =3a(12) =6a(13) =1a(14) =0a(15) =1a(16) =4a(17) =15a(18) =26a(19) =1a(20) =0a(21) =1a(22) =5a(23) =28a(24) =123a(25) =162a(26) =1a(27) =0a(28) =1a(29) =6
External references
- oeis: A322280