A335736 Irregular table read by rows: n-sect the angles of a hexagon. Then T(n,k) = number of k-sided polygons in that figure for k >= 3.

0, 0, 0, 1, 6, 24, 30, 6, 0, 0, 0, 0, 0, 0, 1, 18, 6, 84, 54, 30, 12, 0, 0, 0, 0, 0, 1, 114, 36, 24, 168, 120, 60, 24, 6, 0, 0, 0, 0, 1, 132, 78, 18, 6, 252, 264, 60, 48, 6, 6, 0, 0, 0, 1, 276, 240, 78, 12, 408, 324, 150, 84, 0, 6, 0, 0, 0, 1, 366, 216, 96, 30

Offset

1,5

Comments

For n<=200 no polygon has more than 12 edges.

Links

Table of n, a(n) for n=1..72.

Example

The table begins
0, 0, 0, 1;
6;
24, 30, 6, 0, 0, 0, 0, 0, 0, 1;
18, 6;
84, 54, 30, 12, 0, 0, 0, 0, 0, 1;
114, 36, 24;
168, 120, 60, 24, 6, 0, 0, 0, 0, 1;
132, 78, 18, 6;
252, 264, 60, 48, 6, 6, 0, 0, 0, 1;
276, 240, 78, 12;
408, 324, 150, 84, 0, 6, 0, 0, 0, 1;
366, 216, 96, 30;

Crossrefs

Cf. A331932 (n-sected sides, not angles), A335733 (regions), A335734 (vertices), A335735 (edges).

Sequence in context: A294900 A344700 A064510 * A228383 A249667 A114274

Adjacent sequences: A335733 A335734 A335735 * A335737 A335738 A335739

Keyword

nonn,tabf

Author

Lars Blomberg, Jun 21 2020

Status

approved