The number of Prime Parking Functions

Abstract

A parking function of length $n$ is prime if we obtain a parking function of length $n-1$ by deleting one 1 from it. In this note we give a new direct proof that the number of prime parking functions of length $n$ is $(n-1{)}^{n-1}$. This proof leads to a new interpretation, in close terms to the definition of parking function.