cp's OEIS Frontend

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

%I A292232 #6 Sep 12 2017 11:54:48
%S A292232 1,2,7,23,78,261,887,3008,10268,35112,120445,413979,1425919,4919635,
%T A292232 17000553,58828575,203826882,707008418,2454916048,8532126320,
%U A292232 29679297122,103322632386,359962092302,1254914172463,4377704183644,15280415561913,53365850603107
%N A292232 Number of (unlabeled) rooted trees with n leaf nodes and without unary nodes such that the maximum of the node outdegrees equals six.
%H A292232 Alois P. Heinz, <a href="/A292232/b292232.txt">Table of n, a(n) for n = 6..1000</a>
%H A292232 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%p A292232 b:= proc(n, i, v, k) option remember; `if`(n=0,
%p A292232       `if`(v=0, 1, 0), `if`(i<1 or v<1 or n<v, 0,
%p A292232       `if`(v=n, 1, add(binomial(A(i, k)+j-1, j)*
%p A292232        b(n-i*j, i-1, v-j, k), j=0..min(n/i, v)))))
%p A292232     end:
%p A292232 A:= proc(n, k) option remember; `if`(n<2, n,
%p A292232       add(b(n, n+1-j, j, k), j=2..min(n, k)))
%p A292232     end:
%p A292232 a:= n-> A(n, 6)-A(n, 5):
%p A292232 seq(a(n), n=6..35);
%Y A292232 Column k=6 of A292086.
%K A292232 nonn
%O A292232 6,2
%A A292232 _Alois P. Heinz_, Sep 12 2017