Number of 2-connected claw-free graphs on n nodes.

Terms

a(0) =0a(1) =0a(2) =1a(3) =3a(4) =8a(5) =32a(6) =126a(7) =619a(8) =3332a(9) =20910a(10) =157721a(11) =1590330a(12) =23074092a(13) =487448150a(14) =14466253437a(15) =585505737038