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

A363964

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

Terms

    a(0) =0a(1) =1a(2) =3a(3) =14a(4) =55a(5) =195a(6) =644a(7) =2016a(8) =6048a(9) =17520a(10) =49280a(11) =135168a(12) =362752a(13) =955136a(14) =2472960a(15) =6307840a(16) =15876096a(17) =39481344a(18) =97124352a(19) =236584960a(20) =571146240a(21) =1367539712a(22) =3249799168a(23) =7669284864a(24) =17983078400a(25) =41916825600a(26) =97165246464a(27) =224076496896a(28) =514272002048

External references