976453632

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=30A058843
• Number of 3-colored labeled graphs with n nodes.at n=7A058873