a(n) = number of labeled graphs on n vertices (with no isolated vertices, multi-edges or loops) such that the degree of every vertex is at most 3.

A110041

a(n) = number of labeled graphs on n vertices (with no isolated vertices, multi-edges or loops) such that the degree of every vertex is at most 3.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =4a(4) =41a(5) =512a(6) =8285a(7) =166582a(8) =4054953a(9) =116797432a(10) =3912076929a(11) =150190759240

External references