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 A332609 #15 Apr 28 2020 06:36:56 %S A332609 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 A332609 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 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). %C A332609 See A331452 (the illustrations for T(n,2)) for pictures of these graphs. %H A332609 Scott R. Shannon, <a href="/A331452/a331452_1.txt">Data specifically for nX2 (or 2Xn) rectangles</a> %Y A332609 Cf. A331452, A331453, A331454, A331763, A331765, A331766, A332599, A332600, A331457, A332606, A332607, A332608. %K A332609 nonn %O A332609 1,1 %A A332609 _Scott R. Shannon_ and _N. J. A. Sloane_, Mar 12 2020 %E A332609 a(21)-a(87) from _Lars Blomberg_, Apr 28 2020