Triangle read by rows: T(n,k) is the number of polygons formed by connecting the vertices of a regular 2n-gon such that the winding number around the center is k and with no side passing through the center.
A343369
Triangle read by rows: T(n,k) is the number of polygons formed by connecting the vertices of a regular 2n-gon such that the winding number around the center is k and with no side passing through the center.
Terms
- a(0) =0a(1) =0a(2) =1a(3) =6a(4) =10a(5) =0a(6) =296a(7) =391a(8) =56a(9) =1a(10) =21580a(11) =28298a(12) =6132a(13) =246a(14) =0a(15) =2317884a(16) =3137098a(17) =859536a(18) =70389a(19) =1012a(20) =1a(21) =349281380a(22) =490054052a(23) =158307216a(24) =19756138a(25) =711692a(26) =4082a(27) =0a(28) =70651004192a(29) =102443715659
External references
- oeis: A343369