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 A369176 #12 Jan 22 2024 08:58:30 %S A369176 5,13,31,67,139,247,429,691,1067,1543,2217,3047,4169,5495,7117,9031, %T A369176 11449,14179,17547,21379,25835,30755,36613,43091,50605,58775,68035, %U A369176 78171,89831,102335,116593,132079,149181,167391,187497,208983,232977,258351,285957,315323,347777,381867,419371 %N A369176 Number of vertices in a graph of n adjacent rectangles in a row with all possible diagonals drawn, as in A306302, but without the rectangles' edges which are perpendicular to the row. %H A369176 Scott R. Shannon, <a href="/A369176/a369176.png">Image for n = 1</a>. %H A369176 Scott R. Shannon, <a href="/A369176/a369176_1.png">Image for n = 2</a>. %H A369176 Scott R. Shannon, <a href="/A369176/a369176_2.png">Image for n = 8</a>. %F A369176 a(n) = A369177(n) - A369175(n) + 1 by Euler's formula. %Y A369176 Cf. A369175 (regions), A369177 (edges), A369178 (k-gons), A306302, A331755, A368756. %K A369176 nonn %O A369176 1,1 %A A369176 _Scott R. Shannon_, Jan 15 2024