[math-fun] Tower of Hanoi problem

In the n-plate Towers of Hanoi problem, consider the fixed base of each peg to be plate 0, and number the largest through smallest movable plates 1 through n. In the solution of the problem, how many times is plate p placed on top of plate q (0 <= p,q <= n)?