cp's OEIS Frontend

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.

A354707 Diagonal of A354705.

Original entry on oeis.org

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
Offset: 1

Views

Author

Hugo Pfoertner, Jun 21 2022

Keywords

Comments

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.

Crossrefs

A354492 is the analogous sequence, but for the problem of minimizing the number of grid points covered.