Triangle read by rows: colored polyominoes. For n >= 1, 1 <= k <= n, T(n, k) is the number of k-colored n-celled polyominoes, counted up to rotation, reflection and permutation of the colors. Adjacent cells must be different colors. T(n, k) counts only polyominoes that include all k colors.

A088972

Triangle read by rows: colored polyominoes. For n >= 1, 1 <= k <= n, T(n, k) is the number of k-colored n-celled polyominoes, counted up to rotation, reflection and permutation of the colors. Adjacent cells must be different colors. T(n, k) counts only polyominoes that include all k colors.