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

A244532

Number of ordered 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) =3a(4) =7a(5) =8a(6) =21a(7) =55a(8) =121a(9) =265a(10) =611a(11) =1379a(12) =3193a(13) =7436a(14) =17085a(15) =39339a(16) =91846a(17) =214549a(18) =500132a(19) =1169267a(20) =2743302a(21) =6445797a(22) =15167805a(23) =35749961a(24) =84390645a(25) =199523566a(26) =472429633a(27) =1120012481a(28) =2658525869a(29) =6318368820

External references