|
%I #7 Jul 02 2014 11:43:39
%S 1,0,0,0,0,0,0,0,8,17,18,19,20,21,22,23,116,325,676,1080,1540,2059,
%T 2640,3286,5240,10241,20604,39305,68286,109705,165946,239629,351898,
%U 552311,931070,1633871,2879668,4951860,8208631,13094200,20436400,31939817,50935060
%N Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 8.
%H Alois P. Heinz, <a href="/A244537/b244537.txt">Table of n, a(n) for n = 9..1000</a>
%p b:= proc(n, t, k) option remember; `if`(n=0,
%p `if`(t in [0, k], 1, 0), `if`(t>n, 0, add(b(j-1, k$2)*
%p b(n-j, max(0, t-1), k), j=1..n)))
%p end:
%p a:= n-> b(n-1, 8$2) -b(n-1, 9$2):
%p seq(a(n), n=9..55);
%Y Column k=8 of A244530.
%Y Cf. A244462.
%K nonn
%O 9,9
%A _Joerg Arndt_ and _Alois P. Heinz_, Jun 29 2014
|
