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

A355841

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