Number of unordered triples of disjoint self-avoiding paths with nodes that cover all vertices of a convex n-gon; one node paths are not allowed.
A362786
Number of unordered triples of disjoint self-avoiding paths with nodes that cover all vertices of a convex n-gon; one node paths are not allowed.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =5a(6) =63a(7) =476a(8) =2772a(9) =13680a(10) =60060a(11) =241472a(12) =906048a(13) =3214848a(14) =10890880a(15) =35481600a(16) =111794176a(17) =342171648a(18) =1021031424a(19) =2979102720a(20) =8520171520a(21) =23934468096a(22) =66156625920a(23) =180198047744a(24) =484304486400
External references
- oeis: A362786