Number of labeled connected rooted trivalent graphs with 2n nodes.

A006607

Number of labeled connected rooted trivalent graphs with 2n nodes.

Terms

    a(0) =0a(1) =4a(2) =120a(3) =33600a(4) =18446400a(5) =18361728000

External references