4532034

Appears in sequences

• T(n,k) gives the number of permutations of the set [n] that contain k occurrences of the subword (132); irregular array read by rows (n >= 0 and 0 <= k <= max(0, floor((n-1)/2))).at n=34A197365
• Number of permutations of [n] containing exactly three occurrences of the consecutive pattern 132.at n=4A263887