Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #5 Aug 01 2014 12:36:37
%S 6,63,400,2003,8749,34754,128907,453653,1531833,5001990,15888511,
%T 49313315,150075356,449080945,1324309374,3855721297,11100436053,
%U 31641094693,89395066791,250570651706,697347017396,1928281739720,5300986280922,14495618055341,39446850848309
%N Number of identity trees with n nodes where the maximal outdegree (branching factor) equals 9.
%H Alois P. Heinz, <a href="/A245754/b245754.txt">Table of n, a(n) for n = 36..800</a>
%p b:= proc(n, i, t, k) option remember; `if`(n=0, 1,
%p `if`(i<1, 0, add(binomial(b(i-1$2, k$2), j)*
%p b(n-i*j, i-1, t-j, k), j=0..min(t, n/i))))
%p end:
%p a:= n-> b(n-1$2, 9$2) -b(n-1$2, 8$2):
%p seq(a(n), n=36..70);
%Y Column k=9 of A244523.
%K nonn
%O 36,1
%A _Joerg Arndt_ and _Alois P. Heinz_, Jul 31 2014