Irregular table read by rows: T(n,k) is the number of k-sided polygons, for n>=1 and k>=3, in a hexagon when straight line segments connect the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the hexagon.

A367665

Irregular table read by rows: T(n,k) is the number of k-sided polygons, for n>=1 and k>=3, in a hexagon when straight line segments connect the n-1 points between each corner that divide each edge into n equal parts to the n-1 points on the edge on the opposite side of the hexagon.