Number T(n,k) of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals k; triangle T(n,k), n>=1, 0<=k<=n-1, read by rows.
A244530
Number T(n,k) of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals k; triangle T(n,k), n>=1, 0<=k<=n-1, read by rows.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =1a(6) =0a(7) =4a(8) =0a(9) =1a(10) =0a(11) =11a(12) =2a(13) =0a(14) =1a(15) =0a(16) =36a(17) =5a(18) =0a(19) =0a(20) =1a(21) =0a(22) =117a(23) =11a(24) =3a(25) =0a(26) =0a(27) =1a(28) =0a(29) =393
External references
- oeis: A244530