Number of simple labeled graphs on n+3 nodes with exactly n connected components that are trees or cycles.

A215863

Number of simple labeled graphs on n+3 nodes with exactly n connected components that are trees or cycles.

Terms

    a(0) =0a(1) =19a(2) =135a(3) =540a(4) =1610a(5) =3990a(6) =8694a(7) =17220a(8) =31680a(9) =54945a(10) =90805a(11) =144144a(12) =221130a(13) =329420a(14) =478380a(15) =679320a(16) =945744a(17) =1293615a(18) =1741635a(19) =2311540a(20) =3028410a(21) =3920994a(22) =5022050a(23) =6368700a(24) =8002800a(25) =9971325a(26) =12326769a(27) =15127560a(28) =18438490a(29) =22331160

External references