169967616

Appears in sequences

• Number of colorings of labeled graphs on n nodes using exactly 4 colors, divided by 4!*2^6.at n=7A006202
• 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).at n=31A058875