A354704
T(w,h) is a lower bound for the maximum number of grid points in a square grid covered by an arbitrarily positioned and rotated rectangle of width w and height h, excluding the trivial case of an axis-parallel unshifted cover, where T(w,h) is a triangle read by rows.
Original entry on oeis.org
2, 3, 5, 5, 8, 13, 6, 10, 15, 18, 8, 12, 20, 24, 32, 9, 14, 23, 27, 36, 41, 10, 17, 25, 30, 40, 45, 53, 12, 19, 30, 36, 48, 54, 60, 72, 13, 21, 33, 39, 52, 59, 68, 78, 89, 15, 23, 38, 45, 60, 68, 75, 90, 98, 113, 16, 25, 40, 48, 64, 72, 81, 96, 105, 120, 128, 17, 28, 43, 52, 68, 77, 88, 102, 114, 128, 137, 149
Offset: 1
The triangle begins:
\ h 1 2 3 4 5 6 7 8 9 10 11 12
w \ ----------------------------------------------------
1 | 2; | | | | | | | | | | |
2 | 3, 5; | | | | | | | | | |
3 | 5, 8, 13; | | | | | | | | |
4 | 6, 10, 15, 18; | | | | | | | |
5 | 8, 12, 20, 24, 32; | | | | | | |
6 | 9, 14, 23, 27, 36, 41; | | | | | |
7 | 10, 17, 25, 30, 40, 45, 53; | | | | |
8 | 12, 19, 30, 36, 48, 54, 60, 72; | | | |
9 | 13, 21, 33, 39, 52, 59, 68, 78, 89; | | |
10 | 15, 23, 38, 45, 60, 68, 75, 90, 98, 113; | |
11 | 16, 25, 40, 48, 64, 72, 81, 96, 105, 120, 128; |
12 | 17, 28, 43, 52, 68, 77, 88, 102, 114, 128, 137, 149
Cf.
A123690 (similar problem with circular disks).
A354705
T(w,h) = (w+1)*(h+1) - A354704(w,h) is an upper bound for the deficit in the number of grid points covered by an optimally positioned and rotated cover compared to the excluded singular case of an axis-parallel, unshifted cover, where T(w,h) and A354704 are triangles read by rows.
Original entry on oeis.org
2, 3, 4, 3, 4, 3, 4, 5, 5, 7, 4, 6, 4, 6, 4, 5, 7, 5, 8, 6, 8, 6, 7, 7, 10, 8, 11, 11, 6, 8, 6, 9, 6, 9, 12, 9, 7, 9, 7, 11, 8, 11, 12, 12, 11, 7, 10, 6, 10, 6, 9, 13, 9, 12, 8, 8, 11, 8, 12, 8, 12, 15, 12, 15, 12, 16, 9, 11, 9, 13, 10, 14, 16, 15, 16, 15, 19, 20
Offset: 1
The triangle begins:
\ h 1 2 3 4 5 6 7 8 9 10 11 12
w \ ---------------------------------------------
1 | 2; | | | | | | | | | | |
2 | 3, 4; | | | | | | | | | |
3 | 3, 4, 3; | | | | | | | | |
4 | 4, 5, 5, 7; | | | | | | | |
5 | 4, 6, 4, 6, 4; | | | | | | |
6 | 5, 7, 5, 8, 6, 8; | | | | | |
7 | 6, 7, 7, 10, 8, 11, 11; | | | | |
8 | 6, 8, 6, 9, 6, 9, 12, 9; | | | |
9 | 7, 9, 7, 11, 8, 11, 12, 12, 11; | | |
10 | 7, 10, 6, 10, 6, 9, 13, 9, 12, 8; | |
11 | 8, 11, 8, 12, 8, 12, 15, 12, 15, 12, 16; |
12 | 9, 11, 9, 13, 10, 14, 16, 15, 16, 15, 19, 20
Original entry on oeis.org
1, 2, 2, 4, 4, 4, 9, 7, 9, 4, 9, 16, 7, 16, 8, 14, 9, 12, 23, 13, 21, 8, 17, 32, 20, 28
Offset: 1
A354707 is the analogous sequence, but for the problem of maximizing the number of grid points covered.
Original entry on oeis.org
2, 5, 13, 18, 32, 41, 53, 72, 89, 113, 128, 149, 181, 205, 242, 265, 313, 338, 373, 421, 450, 512, 545, 584, 648, 697
Offset: 1
For examples see the figures in the linked file.
Showing 1-4 of 4 results.
Comments