The Jordan forms of upper triangular nilpotent matrices are indexed by partitions, and over a finite field of q elements, the number of matrices with Jordan form corresponding to a given partition is a polynomial in q. In this talk, I will explain how these polynomials can be calculated recursively, and investigate some properties of these polynomials.