login
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).
3

%I #15 Apr 28 2020 06:36:56

%S 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,

%T 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

%N 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).

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

%H Scott R. Shannon, <a href="/A331452/a331452_1.txt">Data specifically for nX2 (or 2Xn) rectangles</a>

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

%K nonn

%O 1,1

%A _Scott R. Shannon_ and _N. J. A. Sloane_, Mar 12 2020

%E a(21)-a(87) from _Lars Blomberg_, Apr 28 2020