cp's OEIS Frontend

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

%I A244464 #5 Jul 02 2014 14:37:06
%S A244464 1,0,0,0,0,0,0,0,0,0,1,2,2,2,2,2,2,2,2,2,4,7,12,16,21,25,30,34,39,43,
%T A244464 52,65,88,121,165,219,285,360,447,544,661,805,998,1256,1613,2085,2709,
%U A244464 3500,4496,5709,7201,9016,11277,14108,17738,22410,28484,36330
%N A244464 Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 10.
%H A244464 Alois P. Heinz, <a href="/A244464/b244464.txt">Table of n, a(n) for n = 11..900</a>
%p A244464 b:= proc(n, i, t, k) option remember; `if`(n=0, `if`(t in [0, k],
%p A244464       1, 0), `if`(i<1 or t>n, 0, add(binomial(b((i-1)$2, k$2)+j-1, j)*
%p A244464       b(n-i*j, i-1, max(0,t-j), k), j=0..n/i)))
%p A244464     end:
%p A244464 a:= n-> b(n-1$2, 10$2) -b(n-1$2, 11$2):
%p A244464 seq(a(n), n=11..80);
%Y A244464 Column k=10 of A244454.
%Y A244464 Cf. A244539.
%K A244464 nonn
%O A244464 11,12
%A A244464 _Joerg Arndt_ and _Alois P. Heinz_, Jun 29 2014