The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A244464 Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 10. 3

%I #5 Jul 02 2014 14:37:06

%S 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 52,65,88,121,165,219,285,360,447,544,661,805,998,1256,1613,2085,2709,

%U 3500,4496,5709,7201,9016,11277,14108,17738,22410,28484,36330

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

%H Alois P. Heinz, <a href="/A244464/b244464.txt">Table of n, a(n) for n = 11..900</a>

%p b:= proc(n, i, t, k) option remember; `if`(n=0, `if`(t in [0, k],

%p 1, 0), `if`(i<1 or t>n, 0, add(binomial(b((i-1)\$2, k\$2)+j-1, j)*

%p b(n-i*j, i-1, max(0,t-j), k), j=0..n/i)))

%p end:

%p a:= n-> b(n-1\$2, 10\$2) -b(n-1\$2, 11\$2):

%p seq(a(n), n=11..80);

%Y Column k=10 of A244454.

%Y Cf. A244539.

%K nonn

%O 11,12

%A _Joerg Arndt_ and _Alois P. Heinz_, Jun 29 2014

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

Last modified November 29 03:03 EST 2023. Contains 367422 sequences. (Running on oeis4.)