135032832

Appears in sequences

• Irregular triangle read by rows: T(n,k) is the number of colored digraphs on n nodes with color scheme given by the partitions of n in canonical ordering.at n=26A328773
• Regular subtriangle of A328773: T(n,k) is the number of the balanced colored digraphs on n nodes with k colors, 1 <= k <= n.at n=17A330693