Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when connecting infinite lines between all vertices and all points that divide the sides of an equilateral triangle into n equal parts, for k = 3, 4, ..., max_k.

A346446

Irregular triangle read by rows: T(n,k) = number of k-sided polygons formed when connecting infinite lines between all vertices and all points that divide the sides of an equilateral triangle into n equal parts, for k = 3, 4, ..., max_k.

Terms

    a(0) =1a(1) =12a(2) =75a(3) =24a(4) =3a(5) =258a(6) =132a(7) =6a(8) =621a(9) =525a(10) =33a(11) =19a(12) =1308a(13) =1272a(14) =144a(15) =24a(16) =2505a(17) =2628a(18) =345a(19) =61a(20) =4434a(21) =4734a(22) =984a(23) =102a(24) =12a(25) =6a(26) =7365a(27) =7992a(28) =1347a(29) =243

External references