15971909632domain: NAppears in sequencesTriangle 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=33A058843Number of 1-2-3-avoiding permutations with exactly thrice the 1-3-2 pattern.at n=25A093374