|
Search: id:A113881
|
|
|
| A113881 |
|
Table of smallest number of squares, T[m,n], needed to tile an m X n rectangle read by anti-diagonals. |
|
+0
1
|
|
| 1, 2, 2, 3, 1, 3, 4, 3, 3, 4, 5, 2, 1, 2, 5, 6, 4, 4, 4, 4, 6, 7, 3, 4, 1, 4, 3, 7, 8, 5, 2, 5, 5, 2, 5, 8, 9, 4, 5, 3, 1, 3, 5, 4, 9, 10, 6, 5, 5, 5, 5, 5, 5, 6, 10, 11, 5, 3, 2, 5, 1, 5, 2, 3, 5, 11, 12, 7, 6, 6, 5, 5, 5, 5, 6, 6, 7, 12, 13, 6, 6, 4, 6, 4, 1, 4, 6, 4, 6, 6, 13, 14, 8, 4, 6, 2, 3, 7, 7, 3, 2
(list; table; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
T[n,n]=1 (1 n X n square)
T[n,1]=n (n 1 X 1 squares)
T[6,7]=6 (2 3 X 3, 1 4 X 4, 1 2 X 2, 2 1 X 1)
T[11,13]=6 (1 7 X 7, 1 6 X 6, 1 5 X 5, 2 4 X 4 1 1 X 1)
|
|
CROSSREFS
|
Sequence in context: A131821 A143182 A128715 this_sequence A072030 A080045 A089913
Adjacent sequences: A113878 A113879 A113880 this_sequence A113882 A113883 A113884
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
Devin Kilminster (devin(AT)27720.net), Jan 27 2006
|
|
|
Search completed in 0.002 seconds
|
