I have to find the number of permutations of $S = \{3\cdot a, 3\cdot b, 3\cdot c\}$ in which two equal consecutive letters do not appear.
I'm trying to do it for inclusion-exclusion principle, but I can't reach the correct answer.
According to the text, the answer should be 174 permutations.