We present various techniques to count proportions of permutations with restricted cycle structure in finite permutation groups. For example, we show how a generalized block theory for symmetric groups, developed by K¨ulshammer, Olsson, and Robinson, can be used for such calculations. The paper includes improvements of recurrence relations of Glasby, results on average numbers of fixed points in certain permutations, and a remark on a conjecture of Robinson related to the so-called k(GV )-problem of representation theory. We extend and give alternative proofs for previous results of Erd˝os, Tur´an; Glasby; Beals, Leedham-Green, Niemeyer, Praeger, Seress.