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

A308914

Number of unordered pairs 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) =2a(4) =15a(5) =75a(6) =308a(7) =1120a(8) =3744a(9) =11760a(10) =35200a(11) =101376a(12) =282880a(13) =768768a(14) =2042880a(15) =5324800a(16) =13647872a(17) =34467840a(18) =85917696a(19) =211681280a(20) =516096000a(21) =1246429184a(22) =2984509440a(23) =7090470912a(24) =16724787200a(25) =39190528000a(26) =91276443648a(27) =211392921600a(28) =487025803264

External references