For words of length \(n\), generated by independent geometric random variables, we consider the probability that these words avoid a given consecutive \(3\)-letter pattern. As a consequence, we count permutations in \(S_n\) avoiding consecutive \(3\)-letter patterns.
1970-2025 CP (Manitoba, Canada) unless otherwise stated.