|
%I #15 Feb 28 2024 08:45:46
%S 1,2,7,23,78,262,893,3040,10411,35724,122950,424004,1465254,5071981,
%T 17584226,61046464,212197118,738422362,2572261241,8968726829,
%U 31298189180,109307655964,382031357974,1336107044159,4675807680776,16372936282017,57363325974309
%N Limit of the number of (unlabeled) rooted trees without unary nodes where n is the difference between the number of leafs and the maximal outdegree as the tree size increases.
%H Alois P. Heinz, <a href="/A292087/b292087.txt">Table of n, a(n) for n = 0..100</a>
%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%e : a(0) = 1:
%e : o
%e : //( )\\
%e : N N N N N N
%e :
%e : a(1) = 2:
%e : o o
%e : / \ / /|\ \
%e : o N o N N N N
%e : / /|\ \ ( )
%e : N N N N N N N
%e :
%e : a(2) = 7:
%e : o o o o
%e : / \ / \ /( )\ / | \
%e : o N o N o N N N o N N
%e : / \ /( )\ / \ /( )\
%e : o N o N N N o N N N N N
%e : /( )\ ( ) ( )
%e : N N N N N N N N
%e :
%e : o o o
%e : / \ /( )\ / ( \ \
%e : o o o N N N o o N N
%e : /( )\ ( ) /|\ ( ) ( )
%e : N N N N N N N N N N N N N
%e :
%p b:= proc(n, i, v, k) option remember; `if`(n=0,
%p `if`(v=0, 1, 0), `if`(i<1 or v<1 or n<v, 0,
%p `if`(v=n, 1, add(binomial(A(i,k)+j-1, j)*
%p b(n-i*j, i-1, v-j, k), j=0..min(n/i, v)))))
%p end:
%p A:= proc(n, k) option remember; `if`(n<2, n,
%p add(b(n, n+1-j, j, k), j=2..min(n, k)))
%p end:
%p a:= n-> A(2*n+3, n+3)-A(2*n+3, n+2):
%p seq(a(n), n=0..23);
%t b[n_, i_, v_, k_] := b[n, i, v, k] = If[n == 0,
%t If[v == 0, 1, 0], If[i < 1 || v < 1 || n < v, 0,
%t If[v == n, 1, Sum[Binomial[A[i, k] + j - 1, j]*
%t b[n - i*j, i - 1, v - j, k], {j, 0, Min[n/i, v]}]]]];
%t A[n_, k_] := A[n, k] = If[n < 2, n,
%t Sum[b[n, n + 1 - j, j, k], {j, 2, Min[n, k]}]];
%t a[n_] := A[2*n + 3, n + 3] - A[2*n + 3, n + 2];
%t Table[a[n], {n, 0, 23}] (* _Jean-François Alcover_, Feb 28 2024, after _Alois P. Heinz_ *)
%Y Limit of reversed rows of A292086.
%K nonn
%O 0,2
%A _Alois P. Heinz_, Sep 08 2017
|
