The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A245755 Number of identity trees with n nodes where the maximal outdegree (branching factor) equals 10. 2

%I

%S 15,147,1003,5286,24396,101768,395410,1452251,5104104,17300428,

%T 56912396,182543809,573014123,1765525901,5352351017,15996845972,

%U 47213204699,137795770991,398168121417,1140238386377,3238947787201,9133172049405,25582174762816,71220487524663

%N Number of identity trees with n nodes where the maximal outdegree (branching factor) equals 10.

%H Alois P. Heinz, <a href="/A245755/b245755.txt">Table of n, a(n) for n = 42..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, 10\$2) -b(n-1\$2, 9\$2):

%p seq(a(n), n=42..70);

%Y Column k=10 of A244523.

%K nonn

%O 42,1

%A _Joerg Arndt_ and _Alois P. Heinz_, Jul 31 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 29 04:33 EDT 2020. Contains 334697 sequences. (Running on oeis4.)