%I #11 Jul 20 2020 18:57:30

%S 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,

%T 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,

%U 12,4,43,45,10,3,2,38,26,4,4,44,58,15,0,2,60,49,14,10

%N 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.

%C See A335192 for illustrations.

%H Lars Blomberg, <a href="/A335195/b335195.txt">Table of n, a(n) for n = 1..1454</a> (rows 3-300)

%e The table begins

%e 1;

%e 2;

%e 3, 1;

%e 6, 1;

%e 6, 1, 1;

%e 4, 0, 2;

%e 8, 3, 1;

%e 10, 9;

%e 13, 7, 2, 1;

%e 14, 4;

%e 14, 14, 3;

%e 24, 7, 6, 2;

%e 18, 14, 5;

%e 18, 6, 4;

%e 25, 24, 4, 3;

%e 32, 13, 10, 2;

%e 32, 21, 15;

%e 42, 12, 0, 6;

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

%K nonn,tabf

%O 1,2

%A _Lars Blomberg_, May 26 2020