A332609 Maximum number of edges in any cell in the graph formed by drawing the lines connecting any two of the 2*(n+2) perimeter points of a 3 X (n+1) rectangular grid of points (or equally, a 2 X n grid of squares).

4, 4, 5, 5, 5, 6, 5, 6, 8, 6, 6, 6, 6, 6, 6, 6, 6, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6

Offset

1,1

Comments

See A331452 (the illustrations for T(n,2)) for pictures of these graphs.

Links

Table of n, a(n) for n=1..67.

Scott R. Shannon, Data specifically for nX2 (or 2Xn) rectangles

Crossrefs

Cf. A331452, A331453, A331454, A331763, A331765, A331766, A332599, A332600, A331457, A332606, A332607, A332608.

Sequence in context: A080800 A253443 A140341 * A244234 A237449 A003869

Adjacent sequences: A332606 A332607 A332608 * A332610 A332611 A332612

Keyword

nonn

Author

Scott R. Shannon and N. J. A. Sloane, Mar 12 2020

Extensions

a(21)-a(87) from Lars Blomberg, Apr 28 2020

Status

approved