Can anybody find a brick-packing problem where you can fit more bricks into the (3D) torus than you can into the cube? Bricks are AxBxC, not arbitrary polycubes. How about the 2D version?

twenty-five 1x6 rectangles can (perfectly) pack a 10x15 torus, whereas only twenty-four fit into the corresponding non-toroidal rectangle. i believe this example is given by golomb in his book, "polyominoes", but i don't have it at my fingertips at the moment. mike