Number of simple unlabeled graphs on n nodes with exactly 6 connected components that are trees or cycles.

A215986

Number of simple unlabeled graphs on n nodes with exactly 6 connected components that are trees or cycles.

Terms

    a(0) =1a(1) =1a(2) =3a(3) =6a(4) =13a(5) =26a(6) =56a(7) =114a(8) =244a(9) =524a(10) =1152a(11) =2578a(12) =5902a(13) =13750a(14) =32637a(15) =78745a(16) =192755a(17) =478071a(18) =1199357a(19) =3039832a(20) =7774296a(21) =20043911a(22) =52049890a(23) =136041966a(24) =357650346a(25) =945253939a(26) =2510351950a(27) =6696412901a(28) =17935526721a(29) =48218592753

External references