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

A215985

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

Terms

    a(0) =1a(1) =1a(2) =3a(3) =6a(4) =13a(5) =26a(6) =55a(7) =112a(8) =238a(9) =510a(10) =1117a(11) =2498a(12) =5712a(13) =13322a(14) =31643a(15) =76455a(16) =187382a(17) =465393a(18) =1168966a(19) =2966298a(20) =7594035a(21) =19597653a(22) =50933434a(23) =133224112a(24) =350477003a(25) =926855665a(26) =2462830565a(27) =6572892862a(28) =17612586165a(29) =47369774428

External references