Question

Please help! A Double Tower of Hanoi contains 2n disks of n different sizes, two of each size. We're required to move only one disk at a time, without putting a larger one over a smaller one. How many moves does it take to transfer a double tower from one peg to another, if we are also required to reproduce the original top-to-bottom order of all the equal-size disks in the final arrangement?