Permutations, parenthesis words, and Schröder numbers

A different proof for the following result due to West is given: the Schröder number sn−1 equals the number of permutations on [1,2,...,n] that avoid the pattern (3,1,4,2) and its dual (2,4,1,3).