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

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, 20, 4, 128, 132, 36, 16, 8, 1, 156, 120, 24, 16, 192, 196, 60, 36, 0, 5, 200, 220, 28, 12, 244, 312, 80, 56, 0, 1, 296, 276, 60, 44, 360, 372, 112, 76, 12, 1

Offset

1,3

Comments

See A278823 for illustrations.

Links

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

Example

Table begins:
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, 20, 4;
128, 132, 36, 16, 8, 1;
156, 120, 24, 16;
192, 196, 60, 36, 0, 5;
200, 220, 28, 12;
244, 312, 80, 56, 0, 1;
296, 276, 60, 44;
360, 372, 112, 76, 12, 1;

Crossrefs

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

Sequence in context: A032823 A224785 A195547 * A163838 A228091 A157849

Adjacent sequences: A335525 A335526 A335527 * A335529 A335530 A335531

Keyword

nonn,tabf

Author

Lars Blomberg, Jun 12 2020

Status

approved