The sequence defined by $a_n = 2a_{n-1} + n$ with $a_0 = 0$ describes the time complexity of a recursive algorithm. Find the closed form for $a_n$.