cp's OEIS Frontend

A244535 Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 6.

%I A244535 #7 Jul 02 2014 11:38:34
%S A244535 1,0,0,0,0,0,6,13,14,15,16,17,69,190,400,651,946,1288,2186,4425,9126,
%T A244535 17811,31654,51997,85841,149916,276056,518089,960466,1718395,3006963,
%U A244535 5269873,9392821,17032418,31098198,56432687,101350402,180978701,323731177,582832779
%N A244535 Number of ordered unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 6.
%H A244535 Alois P. Heinz, <a href="/A244535/b244535.txt">Table of n, a(n) for n = 7..1000</a>
%p A244535 b:= proc(n, t, k) option remember; `if`(n=0,
%p A244535       `if`(t in [0, k], 1, 0), `if`(t>n, 0, add(b(j-1, k$2)*
%p A244535        b(n-j, max(0, t-1), k), j=1..n)))
%p A244535     end:
%p A244535 a:= n-> b(n-1, 6$2) -b(n-1, 7$2):
%p A244535 seq(a(n), n=7..50);
%Y A244535 Column k=6 of A244530.
%Y A244535 Cf. A244460.
%K A244535 nonn
%O A244535 7,7
%A A244535 _Joerg Arndt_ and _Alois P. Heinz_, Jun 29 2014