Number of forests with three connected components in the complete graph K_{n}.

A239910

Number of forests with three connected components in the complete graph K_{n}.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =6a(4) =45a(5) =435a(6) =5250a(7) =76608a(8) =1316574a(9) =26100000a(10) =587030895a(11) =14780620800a(12) =412069511139

External references