Number of {2,3}-regular graphs; i.e., labeled simple graphs (no multi-edges or loops) on n vertices, each of degree 2 or 3.

A110040

Number of {2,3}-regular graphs; i.e., labeled simple graphs (no multi-edges or loops) on n vertices, each of degree 2 or 3.

Terms

    a(0) =1a(1) =0a(2) =0a(3) =1a(4) =10a(5) =112a(6) =1760a(7) =35150a(8) =848932a(9) =24243520a(10) =805036704a(11) =30649435140

External references