This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A354705 #15 Sep 19 2022 14:13:43 %S A354705 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, %T A354705 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, %U A354705 15,12,15,12,16,9,11,9,13,10,14,16,15,16,15,19,20 %N 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. %C A354705 See A354707 for an interpretation of the diagonal terms. %H A354705 Hugo Pfoertner, <a href="/A354705/b354705.txt">Table of n, a(n) for n = 1..210</a>, rows 1..20 of triangle, flattened %e A354705 The triangle begins: %e A354705 \ h 1 2 3 4 5 6 7 8 9 10 11 12 %e A354705 w \ --------------------------------------------- %e A354705 1 | 2; | | | | | | | | | | | %e A354705 2 | 3, 4; | | | | | | | | | | %e A354705 3 | 3, 4, 3; | | | | | | | | | %e A354705 4 | 4, 5, 5, 7; | | | | | | | | %e A354705 5 | 4, 6, 4, 6, 4; | | | | | | | %e A354705 6 | 5, 7, 5, 8, 6, 8; | | | | | | %e A354705 7 | 6, 7, 7, 10, 8, 11, 11; | | | | | %e A354705 8 | 6, 8, 6, 9, 6, 9, 12, 9; | | | | %e A354705 9 | 7, 9, 7, 11, 8, 11, 12, 12, 11; | | | %e A354705 10 | 7, 10, 6, 10, 6, 9, 13, 9, 12, 8; | | %e A354705 11 | 8, 11, 8, 12, 8, 12, 15, 12, 15, 12, 16; | %e A354705 12 | 9, 11, 9, 13, 10, 14, 16, 15, 16, 15, 19, 20 %Y A354705 Cf. A354707 (diagonal). %Y A354705 Cf. A354702, A354703 (similar, but for minimizing the number of covered points), A354704. %K A354705 nonn,tabl %O A354705 1,1 %A A354705 _Hugo Pfoertner_, Jun 15 2022