|
%I #10 Jun 20 2020 13:32:18
%S 0,0,1,10,10,0,1,50,10,50,60,15,5,0,0,0,1,60,30,110,125,30,0,0,5,5,1,
%T 150,140,20,150,90,70,10,5,0,0,1,240,200,60,10,230,355,75,40,0,5,0,1,
%U 300,190,80,10,360,400,175,25,10,10,0,1,460,430,150,30
%N Irregular table read by rows: n-sect the angles of a pentagon. Then T(n,k) is the number of k-sided polygons in that figure for k >= 3.
%C See A335553 for illustrations.
%C For n<=200 no polygon has more than 10 edges.
%H Lars Blomberg, <a href="/A335556/b335556.txt">Table of n, a(n) for n = 1..1351</a> (the first 200 rows)
%e The table begins
%e 0, 0, 1;
%e 10;
%e 10, 0, 1;
%e 50, 10;
%e 50, 60, 15, 5, 0, 0, 0, 1;
%e 60, 30;
%e 110, 125, 30, 0, 0, 5, 5, 1;
%e 150, 140, 20;
%e 150, 90, 70, 10, 5, 0, 0, 1;
%e 240, 200, 60, 10;
%e 230, 355, 75, 40, 0, 5, 0, 1;
%e 300, 190, 80, 10;
%e 360, 400, 175, 25, 10, 10, 0, 1;
%e 460, 430, 150, 30;
%Y Cf. A331939 (n-sected sides, not angles), A335553 (regions), A335554 (vertices), A335555 (edges).
%K nonn,tabf
%O 1,4
%A _Lars Blomberg_, Jun 20 2020
|
