Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 3.

A244457

Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 3.

Terms

    a(0) =1a(1) =0a(2) =0a(3) =1a(4) =2a(5) =2a(6) =4a(7) =7a(8) =12a(9) =20a(10) =34a(11) =56a(12) =98a(13) =167a(14) =284a(15) =484a(16) =835a(17) =1433a(18) =2467a(19) =4250a(20) =7345a(21) =12700a(22) =22004a(23) =38154a(24) =66266a(25) =115224a(26) =200623a(27) =349654a(28) =610126a(29) =1065739

External references