login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A011274 Triangle of numbers of hybrid rooted trees (divided by Fibonacci numbers). 1

%I #32 Oct 07 2017 02:35:20

%S 1,2,1,7,4,1,31,18,6,1,154,90,33,8,1,820,481,185,52,10,1,4575,2690,

%T 1065,324,75,12,1,26398,15547,6276,2006,515,102,14,1,156233,92124,

%U 37711,12468,3420,766,133,16,1,943174,556664,230277,78030,22412,5439,1085,168,18,1

%N Triangle of numbers of hybrid rooted trees (divided by Fibonacci numbers).

%C Triangle T(n,k) = [x^(n-k)] A(x)^k where A(x) is the o.g.f. of A007863. - _Vladimir Kruchinin_, Mar 17 2011

%C Riordan array (f(x), x*f(x)) where f(x) is the g.f. of A007863. - _Philippe Deléham_, Feb 03 2014

%H Vincenzo Librandi, <a href="/A011274/b011274.txt">Rows n = 1..100, flattened</a>

%H Vladimir Kruchinin, D. V. Kruchinin, <a href="http://arxiv.org/abs/1103.2582">Composita and their properties</a>, arXiv:1103.2582 [math.CO], 2011-2013.

%H J. M. Pallo, <a href="http://dx.doi.org/10.1080/00207169408804251">On the listing and random generation of hybrid binary trees</a>, International Journal of Computer Mathematics, 50 (1994) 135-145.

%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>

%F T(n,k) = (k/n) *Sum_{i=0..n-k} binomial(i+n-1,n-1)*binomial(i+n,n-k-i). - _Vladimir Kruchinin_, Mar 17 2011

%F (r/(m*n+r))*T((m+1)*n+r,m*n+r) = Sum_{k=1..n} k*T((m+1)*n-k,m*n)*T(r+k,r)/n. - _Vladimir Kruchinin_, Mar 17 2011

%F T(n,m) = (m/n)*Sum_{k=1..n-m+1} k*A007863(k-1)*T(n-k,m-1), 1 < m <= n. - _Vladimir Kruchinin_, Mar 17 2011

%e 1

%e 2 1

%e 7 4 1

%e 31 18 6 1

%e 154 90 33 8 1

%e 820 481 185 52 10 1

%e 4575 2690 1065 324 75 12 1

%e Production matrix is:

%e 2 1

%e 3 2 1

%e 5 3 2 1

%e 8 5 3 2 1

%e 13 8 5 3 2 1

%e 21 13 8 5 3 2 1

%e 34 21 13 8 5 3 2 1

%e 55 34 21 13 8 5 3 2 1

%e 89 55 34 21 13 8 5 3 2 1

%e ... - _Philippe Deléham_, Feb 03 2014

%p A011274 := proc(n,k) k/n*add( binomial(i+n-1,n-1)*binomial(i+n,n-k-i),i=0..n-k) ; end proc: # _R. J. Mathar_, Mar 21 2011

%t t[n_, k_] := k/n*Binomial[n, k]*HypergeometricPFQ[ {k-n, n, n+1}, {1/2 + k/2, 1+k/2}, -1/4]; Flatten[ Table[ t[n, k], {n, 1, 10}, {k, 1, n}]] (* _Jean-François Alcover_, Dec 02 2011, after _Vladimir Kruchinin_ *)

%o (Maxima) A011274(n,k):= k/n*sum(binomial(i+n-1,n-1)*binomial(i+n,n-k-i), i,0,n-k); /* _Vladimir Kruchinin_, Mar 17 2011 */

%Y Cf. A000045, A011270, A011272.

%K nonn,easy,tabl,nice

%O 1,2

%A Jean Pallo (pallo(AT)u-bourgogne.fr)

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)