|
%I #5 Jun 25 2020 06:26:56
%S 0,0,0,0,0,0,0,1,10,30,120,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,50,150,240,
%T 60,20,0,0,0,0,0,0,0,0,0,0,0,0,0,1,250,140,40,10,300,510,130,30,0,10,
%U 0,0,0,0,0,0,0,0,0,0,0,1,120,90,10
%N Irregular table read by rows: n-sect the angles of a decagon. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.
%e The table begins
%e 0, 0, 0, 0, 0, 0, 0, 1;
%e 10;
%e 30, 120, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
%e 50;
%e 150, 240, 60, 20, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
%e 250, 140, 40, 10;
%e 300, 510, 130, 30, 0, 10, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
%Y Cf. A332417 (n-sected sides, not angles), A335800 (regions), A335801 (vertices), A335802 (edges).
%K nonn,tabf
%O 1,9
%A _Lars Blomberg_, Jun 25 2020
|
