Counting 1324-avoiding permutations.
Counting bordered partial words by critical positions.
Counting multiderangements by excedances.
Counting occurrences of 132 in an even permutation.
Counting ordered patterns in words generated by morphisms.
Counting pattern-free set partitions. II: Noncrossing and other hypergraphs.
Counting rises, levels, and drops in compositions.
Counting segmented permutations using bicoloured Dyck paths.
Counting stabilized-interval-free permutations.
Counting subwords in a partition of a set.
Counting the number of unavoidable sets of a given size in a finite set of integers.
Counting words by number of occurrences of some patterns.
Covering Sets by Subsets.
Cycle lengths in a permutation are typically Poisson.
Cyclic derangements.