Tower of Hanoi moves

Print or return every move that transfers n disks from the first peg to the third, using the middle peg, never placing a larger disk on a smaller one. Write the recursive solution and explain why it takes 2^n - 1 moves.