The Birthday Paradox in Hash Collisions

A hash function maps inputs to one of $n$ buckets uniformly at random. After hashing $k$ distinct inputs, what is the expected number of collisions? Specifically, find the smallest $k$ (in terms of $n$) such that the probability of at least one collision exceeds $\rac{1}{2}$.