This is a little convoluted, but I decided to set myself the challenge of redesigning Jack D'Aurizio's medalist-selection process so that it consists of $n$ steps, where the first step has $n$ possibilities, the second step has $n+1$ possibilities, and the remaining steps have $2$ possibilities each. (Note that this only makes sense if $n\ge2$.)
Imagine the $n$ people sitting a circle. The first step is to pick a gold medalist; this obviously has $n$ possibilities.
In preparation for the second step, insert an empty chair between the gold medalist and the person sitting to his/her immediate left; for convenience of exposition, let's call the gold medalist Alex, and the person on the other side of the empty chair Bernie.
Now choose one of the $n+1$ chairs. If the chosen chair is the empty one, then Bernie is given a bronze medal and Alex is given the silver; if the chosen chair is occupied by Alex, then Bernie is not given a bronze and Alex is given the silver; in all other cases, the occupant of the chosen chair is given the silver medal.
In preparation for the remaining steps, we remove two people from the circle, namely Alex and the silver medalist, along with Bernie if Alex is the silver medalist. This leaves $n-2$ people, and we now simply decide for each if they are given a bronze medal or not.
Remarks: The only thing I've borrowed, really, from Jack's (excellent) answer is the notion of giving out gold and silver medals to make things concrete. (I added bronze medals to sharpen the concrete imagery a bit.) Arthur's (also excellent) answer is essentially the same as Jack's; it looks like they were composed more or less simultaneously. Mainly it occurred to me that both answers essentially give a combinatorial proof that $\sum k^2{n\choose k}=n(n-1)2^{n-2}+n2^{n-1}$ followed by the (more or less trivial) algebraic identity $n(n-1)2^{n-2}+n2^{n-1}=n(n+1)2^{n+2}$; I just wanted to see if you could eliminate the algebraic middle man.