|
|
A348453
|
|
Irregular triangle read by rows: T(n,k) (n >= 1, 1 <= k <= number of divisors of n^2) is the number of ways to tile an n X n chessboard with d_k rook-connected polyominoes of equal area, where d_k is the k-th divisor of n^2.
|
|
5
|
|
|
1, 1, 2, 1, 1, 10, 1, 1, 70, 117, 36, 1, 1, 4006, 1, 1, 80518, 264500, 442791, 451206, 178939, 80092, 6728, 1, 1, 158753814, 1, 7157114189
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
COMMENTS
|
The board has n^2 squares. The colors do not matter. The tiles are rook-connected polygons made from n^2/d_k squares.
This is the "labeled" version of the problem. Symmetries of the square are not taken into account. Rotations and reflections count as different.
A348452 displays the same data in a less compact way. The present triangle is obtained by omitting the zero entries from A348452.
T(8,2) = 7157114189 (see A348456). T(8,3) is presently unknown.
|
|
LINKS
|
N. J. A. Sloane, Illustration for T(4,2) = 70 [Labels give code, B = length of internal boundary, C = number of internal corners, G = group order, # = number of this type. Note that (B,C) determines the type]
|
|
FORMULA
|
|
|
EXAMPLE
|
The first eight rows of the triangle are:
1,
1, 2, 1,
1, 10, 1,
1, 70, 117, 36, 1,
1, 4006, 1,
1, 80518, 264500, 442791, 451206, 178939, 80092, 6728, 1,
1, 158753814, 1,
1, 7157114189, ?, 187497290034, ?, ?, 1,
...
The corresponding divisors d_k are:
1,
1, 2, 4,
1, 3, 9,
1, 2, 4, 8, 16,
1, 5, 25,
...
The domino is the only polyomino of area 2, and the 36 ways to tile a 4 X 4 square with dominoes are shown in one of the links.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,tabf,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|