Number of connected, unlabeled, unrooted distance-hereditary graphs on n vertices.

A277862

Number of connected, unlabeled, unrooted distance-hereditary graphs on n vertices.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =6a(4) =18a(5) =73a(6) =308a(7) =1484a(8) =7492a(9) =40010a(10) =220676a(11) =1253940a(12) =7282316a(13) =43096792a(14) =259019070a(15) =1577653196a(16) =9720170360a(17) =60492629435a(18) =379820431422

External references