Number of unlabeled and connected graphs on n vertices which are long hole-free (i.e., the graph contains no induced cycle of size 5 or more).

A079455

Number of unlabeled and connected graphs on n vertices which are long hole-free (i.e., the graph contains no induced cycle of size 5 or more).

Terms

    a(0) =1a(1) =1a(2) =2a(3) =6a(4) =20a(5) =104a(6) =716a(7) =7624a(8) =122010a(9) =2946285a(10) =103833895a(11) =5187290899

External references