... positions of the last q − copies of k not affect the number of occurrences of the pattern), and we let A = ab−(q−1) The number of occurrences of 1′ 2p,q that the k’s of σ are part of is seen ... m-subsets of the first p positions, of the number of words σ with k’s in the positions given by the subset The quantity Nm is given by Nm = p fr (n − m, k), m since inserting m copies of k into any of ... is the number of occurrences of τ as a classical pattern and X(τ ′ ) is the number of occurrences of τ ′ as a hidden word, then X(τ ′ ) Y (τ ) = (1) τ ′ ∈T (τ ) the electronic journal of combinatorics...