cp's OEIS Frontend

A292236 Number of (unlabeled) rooted trees with n leaf nodes and without unary nodes such that the maximum of the node outdegrees equals ten.

%I A292236 #5 Sep 12 2017 12:11:07
%S A292236 1,2,7,23,78,262,893,3040,10411,35723,122944,423972,1465111,5071369,
%T A292236 17581720,61036425,212157682,738269419,2571674444,8966493705,
%U A292236 31289748382,109275926876,381912644412,1335664631114,4674164533455,16366851508510,57340851468662
%N A292236 Number of (unlabeled) rooted trees with n leaf nodes and without unary nodes such that the maximum of the node outdegrees equals ten.
%H A292236 Alois P. Heinz, <a href="/A292236/b292236.txt">Table of n, a(n) for n = 10..1000</a>
%H A292236 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%p A292236 b:= proc(n, i, v, k) option remember; `if`(n=0,
%p A292236       `if`(v=0, 1, 0), `if`(i<1 or v<1 or n<v, 0,
%p A292236       `if`(v=n, 1, add(binomial(A(i, k)+j-1, j)*
%p A292236        b(n-i*j, i-1, v-j, k), j=0..min(n/i, v)))))
%p A292236     end:
%p A292236 A:= proc(n, k) option remember; `if`(n<2, n,
%p A292236       add(b(n, n+1-j, j, k), j=2..min(n, k)))
%p A292236     end:
%p A292236 a:= n-> A(n, 10)-A(n, 9):
%p A292236 seq(a(n), n=10..40);
%Y A292236 Column k=10 of A292086.
%K A292236 nonn
%O A292236 10,2
%A A292236 _Alois P. Heinz_, Sep 12 2017