Number of unlabeled connected graphs with n edges with degree >= 3 at each node.

A338604

Number of unlabeled connected graphs with n edges with degree >= 3 at each node.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =3a(4) =5a(5) =9a(6) =27a(7) =67a(8) =198a(9) =646a(10) =2216a(11) =8178a(12) =32095a(13) =132093a(14) =568368a(15) =2541506a(16) =11762657a(17) =56183633a(18) =276288402a(19) =1396172601a(20) =7238931364

External references