Number of unordered triples of self-avoiding paths with nodes that cover all vertices of a convex n-gon.
A359404
Number of unordered triples of self-avoiding paths with nodes that cover all vertices of a convex n-gon.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =15a(6) =315a(7) =4200a(8) =45360a(9) =433440a(10) =3825360a(11) =31944000a(12) =256164480a(13) =1991877888a(14) =15117822720a(15) =112519680000a(16) =824063385600
External references
- oeis: A359404