Number of ways to partition Turan graph T(2n,n) into connected components.

A282010

Number of ways to partition Turan graph T(2n,n) into connected components.

Terms

    a(0) =1a(1) =1a(2) =12a(3) =163a(4) =3411a(5) =97164a(6) =3576001a(7) =163701521a(8) =9064712524a(9) =594288068019

External references