A121486 -id:A121486 - cp's OEIS frontend

A121484 Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n, having k peaks at even level (n>=1,0<=k<=n-1). A nondecreasing Dyck path is a Dyck path for which the sequence of the altitudes of the valleys is nondecreasing.

1, 1, 1, 2, 2, 1, 4, 6, 2, 1, 8, 13, 10, 2, 1, 16, 34, 23, 13, 2, 1, 33, 74, 75, 32, 16, 2, 1, 66, 178, 180, 124, 40, 19, 2, 1, 136, 390, 497, 321, 180, 48, 22, 2, 1, 274, 895, 1192, 1004, 488, 244, 56, 25, 2, 1, 562, 1958, 3033, 2598, 1701, 682, 317, 64, 28, 2, 1, 1138, 4374

Offset: 1

Emeric Deutsch, Aug 02 2006

Row sums are the odd-subscripted Fibonacci numbers (A001519). T(n,0)=A121485(n). Sum(k*T(n,k),k=0..n-1)=A121486(n).

			T(4,2)=2 because we have UDUU|DU|DD and UU|DDUU|DD, where U=(1,1) and D=(1,-1) (the peaks at even level are shown by a |).
Triangle starts:
1;
1,1;
2,2,1;
4,6,2,1;
8,13,10,2,1;
16,34,23,13,2,1;

E. Barcucci, A. Del Lungo, S. Fezzi and R. Pinzani, Nondecreasing Dyck paths and q-Fibonacci numbers, Discrete Math., 170, 1997, 211-217.

Cf. A001519, A121481, A121485, A121486.

G:=z*(1-z^2)*(1-2*z^2-t*z^3)/(1-4*z^2-z-t*z+2*t*z^4+4*z^4-z^6+2*z^3+t*z^3+z^3*t^2): Gser:=simplify(series(G,z=0,15)): P[0]:=1: for n from 1 to 12 do P[n]:=sort(coeff(Gser,z^n)) od: for n from 0 to 12 do seq(coeff(P[n],t,j),j=0..n-1) od; # yields sequence in triangular form

G.f.: G(t,z) = z(1-z^2)(1-2z^2-tz^3)/(1-4z^2-z-tz+2tz^4+4z^4-z^6 +2z^3+tz^3+t^2*z^3).

A121483 Number of peaks at odd level in all nondecreasing Dyck paths of semilength n. A nondecreasing Dyck path is a Dyck path for which the sequence of the altitudes of the valleys is nondecreasing.

Original entry on oeis.org

1, 2, 6, 19, 56, 167, 487, 1411, 4047, 11527, 32617, 91790, 257065, 716896, 1991792, 5515535, 15227846, 41930133, 115176023, 315676425, 863475561, 2357539227, 6425887551, 17487572124, 47522431681, 128969086382, 349567320762

Offset: 1

Emeric Deutsch, Aug 02 2006

nonn

a(n) = Sum(k*A121481(n,k),k=0..n).

			a(2)=2 because in UDUD and UUDD we have altogether 2 peaks at odd level; here U=(1,1) and D=(1,-1).

E. Barcucci, A. Del Lungo, S. Fezzi and R. Pinzani, Nondecreasing Dyck paths and q-Fibonacci numbers, Discrete Math., 170, 1997, 211-217.
Index entries for linear recurrences with constant coefficients, signature (6,-9,-5,15,-1,-4,1).

Cf. A121481, A121486, A038731.

G:=z*(1-z)*(1-3*z+6*z^3-3*z^4)/(1+z)/(1-3*z+z^2)^2/(1-z-z^2): Gser:=series(G,z=0,33): seq(coeff(Gser,z,n),n=1..30);

Rest[CoefficientList[Series[x*(1-x)*(1-3*x+6*x^3-3*x^4)/(1+x)/(1-3*x+x^2)^2/(1-x-x^2), {x, 0, 20}], x]] (* Vaclav Kotesovec, Mar 20 2014 *)

G.f.: z(1-z)(1-3z+6z^3-3z^4)/[(1+z)(1-3z+z^2)^2*(1-z-z^2)].
Recurrence: (n^2 - 5*n - 20)*a(n) = (3*n^2 - 12*n - 79)*a(n-1) + (n^2 - 7*n - 16)*a(n-2) - (5*n^2 - 19*n - 138)*a(n-3) - (n^2 - 6*n - 31)*a(n-4) + (n^2 - 3*n - 24)*a(n-5). - Vaclav Kotesovec, Mar 20 2014
a(n) ~ (sqrt(5)-1) * (3+sqrt(5))^n * n / (5*2^(n+2)). - Vaclav Kotesovec, Mar 20 2014

cp's OEIS Frontend

A121484 Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n, having k peaks at even level (n>=1,0<=k<=n-1). A nondecreasing Dyck path is a Dyck path for which the sequence of the altitudes of the valleys is nondecreasing.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula