We explore a bijection between permutations and colored Motzkin paths that has been used in different forms by Foata and Zeilberger, Biane, and Corteel.
By giving a visual representation of this bijection in terms of so-called cycle diagrams, we find simple translations of some statistics on permutations (and subsets of permutations) into statistics on colored Motzkin paths, which are amenable to the use of continued fractions. We obtain new enumeration formulas for subsets of permutations with respect to fixed points, excedances, double excedances, cycles, and inversions. In particular, we prove that cyclic permutations whose excedances are increasing are counted by the Bell numbers.

Comment: final version formatted for DMTCS