Candidates are graded by their examination results in some such way as 1st B; 2nd equal A, D; 4th equal C, E; and so on. In how many ways gn can n candidates be graded? This problem was solved by Cayley [1, pp. 374-378] and later by others. It does not seem to be well known, and the following result may be of interest.