Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #5 Jul 01 2022 10:37:34
%S 2,4,3,7,4,8,11,9,11,8,16,20,15,20,14,24,11,23,27,20,34,17,31,41,28,32
%N Diagonal of A354705.
%C a(n)-n is an indicator of whether there is still space between the covered grid points and the best possible placed square towards its perimeter. a(n)-n <= 0 for n = 3, 5, 10, 15, 17, 20, 22, ... . A comparison with the linked illustrations from A354706 shows that in all these cases the covering square is rotated by Pi/4 and only slightly exceeds diagonal rows of grid points on all its edges.
%H Hugo Pfoertner, <a href="/A354706/a354706.pdf">Illustrations of diagonal terms A354704(1,1)..A354704(22,22)</a>.
%Y Cf. A354704, A354705, A354706.
%Y A354492 is the analogous sequence, but for the problem of minimizing the number of grid points covered.
%K nonn,hard,more
%O 1,1
%A _Hugo Pfoertner_, Jun 21 2022