cp's OEIS Frontend

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

%I A244538 #7 Jul 02 2014 11:45:11
%S A244538 1,0,0,0,0,0,0,0,0,9,19,20,21,22,23,24,25,26,144,406,841,1335,1891,
%T A244538 2512,3201,3961,4795,7491,14467,28861,54626,94160,150101,225337,
%U A244538 323016,446556,629454,949486,1545877,2639756,4558225,7716325,12629776,19928727,30372551
%N A244538 Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 9.
%H A244538 Alois P. Heinz, <a href="/A244538/b244538.txt">Table of n, a(n) for n = 10..1000</a>
%p A244538 b:= proc(n, t, k) option remember; `if`(n=0,
%p A244538       `if`(t in [0, k], 1, 0), `if`(t>n, 0, add(b(j-1, k$2)*
%p A244538        b(n-j, max(0, t-1), k), j=1..n)))
%p A244538     end:
%p A244538 a:= n-> b(n-1, 9$2) -b(n-1, 10$2):
%p A244538 seq(a(n), n=10..60);
%Y A244538 Column k=9 of A244530.
%Y A244538 Cf. A244463.
%K A244538 nonn
%O A244538 10,10
%A A244538 _Joerg Arndt_ and _Alois P. Heinz_, Jun 29 2014