login
A360630
Number of sets of integer-sided rectangular pieces that can tile an n X n square.
7
1, 4, 21, 192, 2035, 27407
OFFSET
1,2
EXAMPLE
The a(3) = 21 possible sets of pieces that can tile a 3 X 3 square are given in the table below. (Each column on the right gives a set of pieces.)
.
length X width | number of pieces
---------------+------------------------------------------
3 X 3 | 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
2 X 3 | 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
2 X 2 | 0 0 0 0 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0
1 X 3 | 0 1 0 0 1 1 0 0 0 3 2 2 1 1 1 1 0 0 0 0 0
1 X 2 | 0 0 1 0 1 0 2 1 0 0 1 0 3 2 1 0 4 3 2 1 0
1 X 1 | 0 0 1 3 0 2 1 3 5 0 1 3 0 2 4 6 1 3 5 7 9
CROSSREFS
Main diagonal of A360629.
Cf. A034295 (square pieces).
Sequence in context: A158258 A065527 A267988 * A041667 A377828 A286883
KEYWORD
nonn,more
AUTHOR
STATUS
approved