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 A335772 #16 Mar 24 2022 16:33:03 %S A335772 0,0,0,0,0,1,8,16,8,0,0,0,1,64,32,8,112,160,24,24,0,0,0,0,0,0,0,0,0,1, %T A335772 56,24,224,272,72,48,0,0,0,0,0,0,0,0,0,1,304,176,136,8,336,224,104,80, %U A335772 0,0,0,0,0,0,0,0,0,1,496,320,192,40,8 %N A335772 Irregular table read by rows: n-sect the angles of an octagon. Then T(n,k) = number of k-sided polygons in that figure for k >= 3. %C A335772 For n<=200 no polygon has more than 16 edges. %C A335772 See A335769 for illustrations. %H A335772 Lars Blomberg, <a href="/A335772/b335772.txt">Table of n, a(n) for n = 1..2113</a> (the first 200 rows) %e A335772 The table begins %e A335772 0, 0, 0, 0, 0, 1; %e A335772 8; %e A335772 16, 8, 0, 0, 0, 1; %e A335772 64, 32, 8; %e A335772 112, 160, 24, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1; %e A335772 56, 24; %e A335772 224, 272, 72, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1; %e A335772 304, 176, 136, 8; %e A335772 336, 224, 104, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1; %e A335772 496, 320, 192, 40, 8; %Y A335772 Cf. A333076 (n-sected sides, not angles), A335769 (regions), A335770 (vertices), A335771 (edges). %K A335772 nonn,tabf %O A335772 1,7 %A A335772 _Lars Blomberg_, Jun 23 2020