Number of unordered pairs of self-avoiding paths with nodes that cover all vertices of a convex n-gon; one-node paths are allowed.

A359405

Number of unordered pairs of self-avoiding paths with nodes that cover all vertices of a convex n-gon; one-node paths are allowed.

Terms

    a(0) =0a(1) =1a(2) =3a(3) =15a(4) =70a(5) =330a(6) =1596a(7) =7840a(8) =38592a(9) =188640a(10) =911680a(11) =4350720a(12) =20507136a(13) =95560192a(14) =440724480a(15) =2014003200a(16) =9128476672a(17) =41074384896a(18) =183618256896a(19) =816062464000

External references