Number of maximizing weighted k-Sperner families

If $t$ is the $k$th largest rank weight $u_i$, exactly $h$ levels have weight greater than $t$, and exactly $s$ have weight $t$, then there are $\left(\genfrac{}{}{0ex}{}{s}{k-h}\right)$ maximizing families. For fixed $n,k$, the possible counts are exactly $\left(\genfrac{}{}{0ex}{}{s}{j}\right)$ with $1\le j\le k$ and $j\le s\le n+1-k+j$.