Number of unordered pairs of self-avoiding paths with nodes that cover all vertices of a convex n-gon.

A332426

Number of unordered pairs of self-avoiding paths with nodes that cover all vertices of a convex n-gon.

Terms

    a(0) =0a(1) =0a(2) =0a(3) =3a(4) =30a(5) =210a(6) =1260a(7) =6944a(8) =36288a(9) =182880a(10) =897600a(11) =4316928a(12) =20427264a(13) =95373824a(14) =440294400a(15) =2013020160a(16) =9126248448a(17) =41069371392a(18) =183607050240a(19) =816037560320

External references