login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A125177 Triangle read by rows: T(n,0)=C(2n,n)/(n+1) for n>=0; T(0,k)=0 for k>=1; T(n,k)=T(n-1,k)+T(n-1,k-1) for n>=1, k>=1. 4

%I

%S 1,1,1,2,2,1,5,4,3,1,14,9,7,4,1,42,23,16,11,5,1,132,65,39,27,16,6,1,

%T 429,197,104,66,43,22,7,1,1430,626,301,170,109,65,29,8,1,4862,2056,

%U 927,471,279,174,94,37,9,1,16796,6918,2983,1398,750,453,268,131,46,10,1,58786

%N Triangle read by rows: T(n,0)=C(2n,n)/(n+1) for n>=0; T(0,k)=0 for k>=1; T(n,k)=T(n-1,k)+T(n-1,k-1) for n>=1, k>=1.

%C Column k (k>=1) starts with 0, followed by the partial sums of column k-1. Row sums yield A126221.

%C Indexing n and k from 1 instead of from 0, T(n,k) is the number of Dyck n-paths whose first peak is at height k and whose first component avoids DUU. A primitive Dyck path is one whose only return (to ground level) is at the end. The interior returns of a general Dyck path split the path into a list of primitive Dyck paths, called its components. For example, UUDDUD has components UUDD, UD and T(4,2) = 4 counts UUDUDUDD, UUDDUUDD, UUDDUDUD, UUDUDDUD (but not UUDUUDDD because its first component contains a DUU). - _David Callan_, Jan 17 2007

%C Riordan array (c(x),x/(1-x)), c(x) the g.f. of A000108. Equal to ((1-x)*c(x),x)*A007318. [_Paul Barry_, May 06 2009]

%H Seiichi Manyama, <a href="/A125177/b125177.txt">Table of n, a(n) for n = 0..10000</a>

%F G.f.: G(t,x)=(1-x)[1-sqrt(1-4x)]/[2x(1-x-tx)].

%F T(n,k) = Sum_{j=0..n} C(n-j,k)*if(j=0,0^j, A000108(j)-A000108(j-1)). [_Paul Barry_, May 06 2009]

%F T(n,k) = Sum_{i=0..n-k} binomial(n-i-1,n-k-i)*A000108(i). - _Vladimir Kruchinin_, Nov 03 2016

%e First few rows of the triangle are:

%e 1;

%e 1, 1;

%e 2, 2, 1;

%e 5, 4, 3, 1;

%e 14, 9, 7, 4, 1;

%e 42, 23, 16, 11, 5, 1;

%e ...

%e (5,3) = 16 = 7 + 9 = (4,3) + (4,2).

%e Contribution from _Paul Barry_, May 06 2009: (Start)

%e Production matrix is

%e 1, 1,

%e 1, 1, 1,

%e 1, 0, 1, 1,

%e 2, 0, 0, 1, 1,

%e 4, 0, 0, 0, 1, 1,

%e 9, 0, 0, 0, 0, 1, 1,

%e 21, 0, 0, 0, 0, 0, 1, 1,

%e 51, 0, 0, 0, 0, 0, 0, 1, 1,

%e 127, 0, 0, 0, 0, 0, 0, 0, 1, 1 (End)

%p T:=proc(n,k) if k=0 then binomial(2*n,n)/(n+1) elif n=0 then 0 else T(n-1,k)+T(n-1,k-1) fi end: for n from 0 to 11 do seq(T(n,k),k=0..n) od; # yields sequence in triangular form

%p G:=(1-x)*(1-sqrt(1-4*x))/2/x/(1-x-t*x): Gser:=simplify(series(G,x=0,15)): for n from 0 to 11 do P[n]:=sort(coeff(Gser,x,n)) od: for n from 0 to 11 do seq(coeff(P[n],t,j),j=0..n) od; # yields sequence in triangular form

%o (Maaxima) T(n,k)=sum((binomial(2*i,i)*binomial(n-i-1,n-k-i))/(i+1),i,0,n-k); /* _Vladimir Kruchinin_, Nov 03 2016 */

%Y Cf. A000108, A125178, A126221.

%K nonn,tabl

%O 0,4

%A _Gary W. Adamson_, Nov 22 2006

%E Edited by _Emeric Deutsch_, Dec 28 2006

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 11:10 EDT 2019. Contains 321329 sequences. (Running on oeis4.)