Optimally pebbling hypercubes and powers

We point out that the optimal pebbling number of the n-cube is image, and explain how to approximate the optimal pebbling number of the nth cartesian power of any graph in a similar way.