Centrosymmetric words avoiding 3-letter permutation patterns

A word is centrosymmetric if it is invariant under the reverse-complement map. In this paper, we give enumerative results on $k$-ary centrosymmetric words of length $n$ avoiding a pattern of length 3 with no repeated letters.