login
Irregular table read by rows: T(n,k) = number of k-sided polygons formed by n-secting the angles of a square for k >= 3.
3

%I #4 Jun 12 2020 09:23:15

%S 0,1,4,12,16,0,0,0,1,24,4,4,48,28,8,4,4,1,52,32,80,68,28,12,0,1,96,68,

%T 20,4,128,132,36,16,8,1,156,120,24,16,192,196,60,36,0,5,200,220,28,12,

%U 244,312,80,56,0,1,296,276,60,44,360,372,112,76,12,1

%N Irregular table read by rows: T(n,k) = number of k-sided polygons formed by n-secting the angles of a square for k >= 3.

%C See A278823 for illustrations.

%e Table begins:

%e 0, 1;

%e 4;

%e 12, 16, 0, 0, 0, 1;

%e 24, 4, 4;

%e 48, 28, 8, 4, 4, 1;

%e 52, 32;

%e 80, 68, 28, 12, 0, 1;

%e 96, 68, 20, 4;

%e 128, 132, 36, 16, 8, 1;

%e 156, 120, 24, 16;

%e 192, 196, 60, 36, 0, 5;

%e 200, 220, 28, 12;

%e 244, 312, 80, 56, 0, 1;

%e 296, 276, 60, 44;

%e 360, 372, 112, 76, 12, 1;

%Y Cf. A335413, A278823 (regions), A335526 (vertices), A335527 (edges).

%K nonn,tabf

%O 1,3

%A _Lars Blomberg_, Jun 12 2020