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 A332606 #9 Apr 28 2020 06:38:03 %S A332606 14,48,102,192,326,524,802,1192,1634,2296,3074,4052,5246,6740,8398, %T A332606 10440,12770,15512,18782,22384,26386,31204,36482,42232,48826,56508, %U A332606 64318,73356,83366,93996,106010,118788,132634,148600,164814,182648,201998,223172,245634 %N A332606 Number of triangles 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 A332606 See A331452 (the illustrations for T(n,2)) for pictures of these graphs. %H A332606 Lars Blomberg, <a href="/A332606/b332606.txt">Table of n, a(n) for n = 1..100</a> %H A332606 Scott R. Shannon, <a href="/A331452/a331452_1.txt">Data specifically for nX2 (or 2Xn) rectangles</a> %Y A332606 Cf. A331452, A331453, A331454, A331763, A331765, A331766, A332599, A332600, A331457, A332607, A332608, A332609. %K A332606 nonn %O A332606 1,1 %A A332606 _Scott R. Shannon_ and _N. J. A. Sloane_, Mar 12 2020 %E A332606 a(21) and beyond from _Lars Blomberg_, Apr 28 2020