Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n).

A058843

Triangle T(n,k) = C_n(k) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1<=k<=n).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =1a(4) =12a(5) =8a(6) =1a(7) =80a(8) =192a(9) =64a(10) =1a(11) =720a(12) =5120a(13) =5120a(14) =1024a(15) =1a(16) =9152a(17) =192000a(18) =450560a(19) =245760a(20) =32768a(21) =1a(22) =165312a(23) =10938368a(24) =56197120a(25) =64225280a(26) =22020096a(27) =2097152a(28) =1a(29) =4244480

External references