Number of connected diamond-free graphs on n nodes.

A242790

Number of connected diamond-free graphs on n nodes.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =4a(4) =11a(5) =39a(6) =165a(7) =967a(8) =7684a(9) =87012a(10) =1410465a(11) =32640019

External references