Polyominoes which tile rectangles (Q757389)

\textit{D. A. Klarner} [J. Comb. Theory 7, No.2, 107-115 (1969; Zbl 0174.041)] defined the order n of a polyomino P as the minimum number of congruent copies of P which can be assembled to form a rectangle. For those polyominoes which will not tile any rectangle, the order is undefined. Here we show that there are infinitely many dissimilar polyomino examples for every order n which is a multiple of n.