A335195 Irregular table read by rows: T(n,k) = number of k-sided polygons for k >= 3 in an n-gon with straight line segments connecting vertex k to vertex 3k mod n.

1, 2, 3, 1, 6, 1, 6, 1, 1, 4, 0, 2, 8, 3, 1, 10, 9, 13, 7, 2, 1, 14, 4, 14, 14, 3, 24, 7, 6, 2, 18, 14, 5, 18, 6, 4, 25, 24, 4, 3, 32, 13, 10, 2, 32, 21, 15, 42, 12, 0, 6, 32, 31, 13, 42, 35, 12, 4, 43, 45, 10, 3, 2, 38, 26, 4, 4, 44, 58, 15, 0, 2, 60, 49, 14, 10

Offset: 1

Author

Lars Blomberg, May 26 2020

Keywords

• nonn
• tabf

Comments

See A335192 for illustrations.

Examples

			The table begins
1;
2;
3, 1;
6, 1;
6, 1, 1;
4, 0, 2;
8, 3, 1;
10, 9;
13, 7, 2, 1;
14, 4;
14, 14, 3;
24, 7, 6, 2;
18, 14, 5;
18, 6, 4;
25, 24, 4, 3;
32, 13, 10, 2;
32, 21, 15;
42, 12, 0, 6;
		

Links

• Lars Blomberg, Table of n, a(n) for n = 1..1454 (rows 3-300)

Crossrefs

Cf. A335192 (regions), A335193 (edges), A335194 (vertices).