Parking functions with zero secondary dinv

Abstract

We show that the number of parking functions of length $n$ with zero secondary dinv is equal to the number of ordered cycle decompositions of permutations of $[n]$.