  We offer elementary proofs for several results in consecutive pattern
containment that were previously demonstrated using ideas from cluster method
and analytical combinatorics. Furthermore, we establish new general bounds on
the growth rates of consecutive pattern avoidance in permutations.
