Number of ways to place nonintersecting diagonals in convex (n+3)-gon so as to create exactly one triangle.
A253192
Number of ways to place nonintersecting diagonals in convex (n+3)-gon so as to create exactly one triangle.
Terms
- a(0) =1a(1) =0a(2) =5a(3) =6a(4) =35a(5) =80a(6) =309a(7) =890a(8) =3058a(9) =9580a(10) =31863a(11) =103054a(12) =340415a(13) =1116032a(14) =3688745a(15) =12176814a(16) =40344505a(17) =133742500a(18) =444262378a(19) =1477142040a(20) =4918099660a(21) =16390294664a(22) =54679621775a(23) =182572812266a(24) =610115196150
External references
- oeis: A253192