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 A332607 #11 Apr 28 2020 06:37:40 %S A332607 2,8,36,92,194,336,554,812,1314,1756,2508,3252,4348,5464,7054,8760, %T A332607 11050,13324,16162,19256,23188,27120,32098,37396,43456,49516,57608, %U A332607 65440,74670,84388,95674,107656,120990,133996,150144,166424,185090,203960,224926,247120 %N A332607 Number of quadrilaterals 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 A332607 See A331452 (the illustrations for T(n,2)) for pictures of these graphs. %H A332607 Lars Blomberg, <a href="/A332607/b332607.txt">Table of n, a(n) for n = 1..100</a> %H A332607 Scott R. Shannon, <a href="/A331452/a331452_1.txt">Data specifically for nX2 (or 2Xn) rectangles</a> %Y A332607 Cf. A331452, A331453, A331454, A331763, A331765, A331766, A332599, A332600, A331457, A332606, A332608, A332609. %K A332607 nonn %O A332607 1,1 %A A332607 _Scott R. Shannon_ and _N. J. A. Sloane_, Mar 12 2020 %E A332607 a(21) and beyond from _Lars Blomberg_, Apr 28 2020