The Tower of Hanoi problem requires moving $n$ disks from one peg to another. The minimum number of moves satisfies $M(n) = 2M(n-1) + 1$ with $M(1) = 1$. How many moves are needed for $n = 6$ disks?