|
|
A219158
|
|
Minimum number of integer-sided squares needed to tile an m X n rectangle.
|
|
17
|
|
|
1, 2, 1, 3, 3, 1, 4, 2, 4, 1, 5, 4, 4, 5, 1, 6, 3, 2, 3, 5, 1, 7, 5, 5, 5, 5, 5, 1, 8, 4, 5, 2, 5, 4, 7, 1, 9, 6, 3, 6, 6, 3, 6, 7, 1, 10, 5, 6, 4, 2, 4, 6, 5, 6, 1, 11, 7, 6, 6, 6, 6, 6, 6, 7, 6, 1, 12, 6, 4, 3, 6, 2, 6, 3, 4, 5, 7, 1, 13, 8, 7, 7, 6, 6, 6, 6, 7, 7, 6, 7, 1
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Triangular array read by rows. m=1,2,...,n; n=1,2,3,...
|
|
LINKS
|
|
|
EXAMPLE
|
T(6,5) = 5 because a 6 X 5 rectangle can be subdivided into two 3 X 3 squares and three 2 X 2 squares.
Triangle begins:
1;
2, 1;
3, 3, 1;
4, 2, 4, 1;
5, 4, 4, 5, 1;
6, 3, 2, 3, 5, 1;
7, 5, 5, 5, 5, 5, 1;
8, 4, 5, 2, 5, 4, 7, 1;
9, 6, 3, 6, 6, 3, 6, 7, 1;
10, 5, 6, 4, 2, 4, 6, 5, 6, 1;
11, 7, 6, 6, 6, 6, 6, 6, 7, 6, 1;
12, 6, 4, 3, 6, 2, 6, 3, 4, 5, 7, 1;
13, 8, 7, 7, 6, 6, 6, 6, 7, 7, 6, 7, 1;
14, 7, 7, 5, 7, 5, 2, 5, 7, 5, 7, 5, 7, 1;
15, 9, 5, 7, 3, 4, 8, 8, 4, 3, 7, 5, 8, 7, 1;
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|