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