4244480

Appears in sequences

• 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).at n=29A058843
• Number of 2-colored labeled graphs with n nodes.at n=7A058872