Allowing or prohibiting two consecutive colors in \(n\)-color compositions (Q6635588)

A composition of an integer \(n\) is an ordered sequence of integers summing up to \(n\). There is an \(1-1\) correspondence between the compositions and the tilings of a \(1\times n\) board, where every part \(k\) of a composition is represented by an \(1\times k\) block. Now, assume that every part \(k\) can be colored with any of the colors \(1,\dots, k\). This leads to the colored compositions. Instead of using all the colors from \(\{1,\dots, k\}\) one can consider only a subset of it. The authors analyze the properties of the colored compositions where one allows only two consecutive colors.