cp's OEIS Frontend

A244456 Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 2.

%I A244456 #15 Feb 06 2015 08:10:41
%S A244456 1,0,1,2,4,7,15,28,56,110,220,436,878,1762,3560,7205,14650,29838,
%T A244456 60991,124938,256628,528238,1089834,2252860,4666304,9682422,20125777,
%U A244456 41900433,87369029,182441944,381499040,798782945,1674575394,3514733683,7385298837,15534856067
%N A244456 Number of unlabeled rooted trees with n nodes such that the minimal outdegree of inner nodes equals 2.
%H A244456 Alois P. Heinz, <a href="/A244456/b244456.txt">Table of n, a(n) for n = 3..900</a>
%F A244456 a(n) ~ c * d^n / n^(3/2), where d = A246403 = 2.18946198566085056388702757711..., c = 0.4213018528699249210965028... (constants are same as for A001679). - _Vaclav Kotesovec_, Jul 02 2014
%e A244456 a(5) = 1:
%e A244456       o
%e A244456      / \
%e A244456     o   o
%e A244456    / \
%e A244456   o   o
%p A244456 b:= proc(n, i, t, k) option remember; `if`(n=0, `if`(t in [0, k],
%p A244456       1, 0), `if`(i<1 or t>n, 0, add(binomial(b((i-1)$2, k$2)+j-1, j)*
%p A244456       b(n-i*j, i-1, max(0,t-j), k), j=0..n/i)))
%p A244456     end:
%p A244456 a:= n-> b(n-1$2, 2$2) -b(n-1$2, 3$2):
%p A244456 seq(a(n), n=3..40);
%t A244456 b[n_, i_, t_, k_] := b[n, i, t, k] = If[n == 0, If[t == 0 || t == k, 1, 0], If[i < 1, 0, Sum[Binomial[b[i - 1, i - 1, k, k] + j - 1, j]*b[n - i*j, i - 1, Max[0, t - j], k], {j, 0, n/i}]]]; a[n_] := b[n - 1, n - 1, 2, 2] - b[n - 1, n - 1, 3, 3] // FullSimplify; Table[a[n], {n, 3, 40}] (* _Jean-François Alcover_, Feb 06 2015, after Maple *)
%Y A244456 Column k=2 of A244454.
%Y A244456 Cf. A244531, A246403.
%K A244456 nonn
%O A244456 3,4
%A A244456 _Joerg Arndt_ and _Alois P. Heinz_, Jun 29 2014