
EXAMPLE

For n=2, we are constructing a square from 4 labeled linesegments with labeled endpoints. Solutions which differ by a rotation or a reflection are considered equivalent. There are 3 ways to order the linesegments, and each linesegment can be oriented in 2 ways, so the total number of solutions is 3 * 2^4 = 96. (equivalently, 6 * 2^3, which more closely resembles the formula provided.) For n=3, we are constructing a cube from 6 labeled squares with labeled vertices. Without loss of generality, we can pick one labeled square to serve as our face of reference. For this face, we do not care which side of the square will face the interior of the cube as this just translates into a reflection of the cube, nor we do not care about which rotation we pick as these just translate into rotations of the cube. From this reference square, there are 5! ways to assign the remaining squares to the faces of the cube, and each square can be oriented in 8 ways (we can pick which side of the square will face the interior of the cube, and we can pick from 4 rotations). This gives 8^5 * 5! solutions.
