@TobiasKildetoft consider any way of writing $k=(a_1+a_2+\dots+a_l)$ with $a_i \in \Bbb N$, consider the set $\operatorname{Part}(X,(a_1,a_2, \dots, a_l))$ of all partitions of $X$ into a partition consisting of an $a_1$ element set, an $a_2$ element set etc. $\operatorname{Part}(X,(a_1,a_2, \dots, a_l))$ carries a natural $S_k$ action.
Fix a $l$ possible colors $c_1, \dots, c_l$
Define a map $\operatorname{Part}(X,(a_1,a_2, \dots, a_l)) \to \operatorname{Col}_n(X)$ by sending a partition $P=\{P_1, \dots, P_l\}$ to the coloring that colors all elements from $P_1$ in $a_1$, all elements in $…