Number of unlabeled connected simple graphs with n nodes of degree 4 or less and degree at least 2 which are not 4-regular graphs.

A289990

Number of unlabeled connected simple graphs with n nodes of degree 4 or less and degree at least 2 which are not 4-regular graphs.

Terms

    a(0) =0a(1) =0a(2) =1a(3) =3a(4) =10a(5) =37a(6) =161a(7) =878a(8) =5605a(9) =41912a(10) =355558a(11) =3359250a(12) =34723752a(13) =388248880a(14) =4655392910a(15) =59493136018a(16) =806368182523

External references