A335772 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.

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, 56, 24, 224, 272, 72, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 304, 176, 136, 8, 336, 224, 104, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 496, 320, 192, 40, 8

Offset

1,7

Comments

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

See A335769 for illustrations.

Links

Lars Blomberg, Table of n, a(n) for n = 1..2113 (the first 200 rows)

Example

The table begins
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;
56, 24;
224, 272, 72, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
304, 176, 136, 8;
336, 224, 104, 80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1;
496, 320, 192, 40, 8;

Crossrefs

Cf. A333076 (n-sected sides, not angles), A335769 (regions), A335770 (vertices), A335771 (edges).

Sequence in context: A073926 A073925 A053321 * A299214 A174256 A037239

Adjacent sequences: A335769 A335770 A335771 * A335773 A335774 A335775

Keyword

nonn,tabf

Author

Lars Blomberg, Jun 23 2020

Status

approved