Counting occurrences of a pattern of type (1, 2) or (2, 1) in permutations (Q1865264)

An occurrence of \(1-23\) pattern (\(1-32\) pattern) in a permutation \(\pi =a_{1}a_{2}\dots a_{n}\) is a subword \(a_{i}a_{j}a_{j+1}\) of \(\pi \) such that \( a_{i}<a_{j}<a_{j+1}\) (\(a_{i}<a_{j+1}<a_{j}\)). In the paper a recursion formula for the number of permutations containing exactly one occurrence of the pattern \(1-23\) (pattern \(1-32)\) as well as an ordinary generating function for these numbers is given.