cp's OEIS Frontend

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

%I A244539 #7 Jul 02 2014 11:47:17
%S A244539 1,0,0,0,0,0,0,0,0,0,10,21,22,23,24,25,26,27,28,29,175,496,1024,1617,
%T A244539 2278,3010,3816,4699,5662,6708,10310,19721,39074,73487,125862,199365,
%U A244539 297436,423799,582472,777777,1060410,1547051,2443649,4072732,6905106,11528110
%N A244539 Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 10.
%H A244539 Alois P. Heinz, <a href="/A244539/b244539.txt">Table of n, a(n) for n = 11..1000</a>
%p A244539 b:= proc(n, t, k) option remember; `if`(n=0,
%p A244539       `if`(t in [0, k], 1, 0), `if`(t>n, 0, add(b(j-1, k$2)*
%p A244539        b(n-j, max(0, t-1), k), j=1..n)))
%p A244539     end:
%p A244539 a:= n-> b(n-1, 10$2) -b(n-1, 11$2):
%p A244539 seq(a(n), n=11..60);
%Y A244539 Column k=10 of A244530.
%Y A244539 Cf. A244464.
%K A244539 nonn
%O A244539 11,11
%A A244539 _Joerg Arndt_ and _Alois P. Heinz_, Jun 29 2014