Select polyominoes for a set (currently 1 or 2), for which tilings should be shown.
Then click "Show" button.
You may also see list of all polyomino sets for which data is available here.
Area: 6.
Size: 2x4.
Holes: 0.
Order: 2.
Square order: 24.
Prime rectangles: ≥ 1.
Smallest rectangle (3x4):
Smallest square (12x12):
Blue number - strongly prime rectangle (which cannot be divided into two or more number of rectangles tileable by this set).
Green number - weakly prime rectangle (which cannot be divided into two rectangles tileable by this set, but which can be divided into three or more rectangles).
Purple number - prime rectangle (unknown if weakly or strongly prime).
Red number - composite rectangle (which can be divided into two rectangles tileable by this set).
Gray number - it is unknown whether rectangle is prime or composite.
Question mark (?) - solution count is unknown.
Click on underlined numbers to view picture with one solution.
Smallest prime reptile (6Fx8):
$N(w; h)$ - number of ways to tile $w\times h$ rectangle (including symmetric solutions)
$T(w; h) = \begin{cases} 1, & N(w; h) \geq 1 \\ 0, & \text{else} \end{cases}$ - tileability function, $1$ if tiles rectangle, $0$ otherwise
$A(w; h) = \left(N(w; h)\right)^{\frac{1}{wh}}$ - average number of ways to tile cell in $w\times h$ rectangle (including symmetric solutions)
$G(T; x; y) = \sum_{w=1}^{\infty}\sum _{h=1}^{\infty}T(w; h)x^wy^h$ - bivariate generating function of $T(w; h)$
$G(A; x; y) = \sum_{w=1}^{\infty}\sum _{h=1}^{\infty}A(w; h)x^wy^h$ - bivariate generating function of $A(w; h)$
$N(1; n) = T(1; n) = 0, \qquad n \geq 1 \tag{1}$
$N(2; n) = T(2; n) = 0, \qquad n \geq 1 \tag{2}$
$N(3; n) = 2 \times N(3; n - 4), \qquad n \geq 5 \tag{3}$
$N(4; n) = 2 \times N(4; n - 3), \qquad n \geq 4 \tag{4}$
$N(5; n) = T(5; n) = 0, \qquad n \geq 1 \tag{5}$
$N(6; n) = 4 \times N(6; n - 4), \qquad n \geq 5 \tag{6}$
$N(7; n) = 288 \times N(7; n - 12), \qquad n \geq 13 \tag{7}$
$N(8; n) = 4 \times N(8; n - 3), \qquad n \geq 4 \tag{8}$
$N(9; n) = 8 \times N(9; n - 4), \qquad n \geq 5 \tag{9}$
$N(10; n) = 4384 \times N(10; n - 12) - 483584 \times N(10; n - 24) + 3604480 \times N(10; n - 36) + 100663296 \times N(10; n - 48), \qquad n \geq 49 \tag{10}$
$N(11; n) = 7296 \times N(11; n - 12), \qquad n \geq 13 \tag{11}$
$N(12; n) = 8 \times N(12; n - 3) + 20 \times N(12; n - 4) - 64 \times N(12; n - 8), \qquad n \geq 9 \tag{12}$
