What is the formula for the Hanoi puzzle?

I'm trying to recall the formula for solving the Hanoi puzzle. It's a recursive problem where you have to move disks from one peg to another, with some rules about how you can move them. What's the formula that tells you the minimum number of moves needed to solve it?