How many arrangements (permutations) of a set of $\frac{n(n+1)}{2}$ distinct cards, each having one of $n$ colors $c_1,\ldots,c_n$ where there are $i$ cards of color $c_i$ that are numbered $1,2,\ldots,i$, satisfy the following constraint: any two cards of the same color and with consecutive numbers cannot be adjacent in the arrangement. This seems to be similar to this problem, but in our case all the cards are distinct, whereas in that problem the cards of the same color are all identical.
Asked
Active
Viewed 600 times
2
$a(1)=1, ;a(2)=2,;a(3)=216,;a(4)=954432,;a(5)=313067602560,;a(6)=11394325627300281600,;a(7)=64336748997032761512891479040,;a(8)=75093144953318072478960408305125194792960.$ – nczksv Jul 29 '17 at 16:27