Array read by antidiagonals: T(n,k) is the number of connected graphs on n labeled nodes, each node being colored with one of k colors, where no edge connects two nodes of the same color.

A322279

Array read by antidiagonals: T(n,k) is the number of connected 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) =0a(9) =0a(10) =1a(11) =3a(12) =2a(13) =0a(14) =0a(15) =1a(16) =4a(17) =6a(18) =6a(19) =0a(20) =0a(21) =1a(22) =5a(23) =12a(24) =42a(25) =38a(26) =0a(27) =0a(28) =1a(29) =6

External references