Kessler and Livingstone proved an asymptotic formula for the expected length of the largest part of a partition drawn uniformly at random. As a first step they gave an exact formula expressed as a weighted sum of Euler's partition function. Here we give a short bijective proof of a generalization of this exact formula to the expected length of the kth part.