Triangle read by rows: T(n,k) is the number of non-equivalent regular polygons with n+1 edges, one of which is rooted, which are dissected by non-intersecting diagonals into k regions, such that two such polygons are identified up to reflection along the rooted edge and twisting along the diagonals that does not affect the root edge (for 1 <= k <= n-1 and n >= 2).
A232206
Triangle read by rows: T(n,k) is the number of non-equivalent regular polygons with n+1 edges, one of which is rooted, which are dissected by non-intersecting diagonals into k regions, such that two such polygons are identified up to reflection along the rooted edge and twisting along the diagonals that does not affect the root edge (for 1 <= k <= n-1 and n >= 2).
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =2a(6) =1a(7) =5a(8) =8a(9) =3a(10) =1a(11) =8a(12) =22a(13) =20a(14) =6a(15) =1a(16) =11a(17) =46a(18) =73a(19) =49a(20) =11a(21) =1a(22) =15a(23) =87a(24) =206a(25) =233a(26) =119a(27) =23a(28) =1a(29) =19
External references
- oeis: A232206