Triangle T(n,k) = C_n(k)/2^(k*(k-1)/2) where C_n(k) = number of k-colored labeled graphs with n nodes (n >= 1, 1 <= k <= n).
A058875
Triangle T(n,k) = C_n(k)/2^(k*(k-1)/2) 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) =1a(3) =1a(4) =6a(5) =1a(6) =1a(7) =40a(8) =24a(9) =1a(10) =1a(11) =360a(12) =640a(13) =80a(14) =1a(15) =1a(16) =4576a(17) =24000a(18) =7040a(19) =240a(20) =1a(21) =1a(22) =82656a(23) =1367296a(24) =878080a(25) =62720a(26) =672a(27) =1a(28) =1a(29) =2122240
External references
- oeis: A058875