A121530 -id:A121530 - cp's OEIS frontend

A121529 Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n and having k double rises at an odd level (n >= 1, k >= 0).

1, 1, 1, 1, 4, 1, 10, 2, 1, 19, 14, 1, 33, 50, 5, 1, 55, 132, 45, 1, 90, 301, 205, 13, 1, 146, 631, 680, 139, 1, 236, 1255, 1892, 763, 34, 1, 381, 2409, 4717, 3019, 419, 1, 615, 4509, 10920, 9846, 2677, 89, 1, 993, 8283, 23974, 28292, 12241, 1241, 1, 1604, 14998

Offset: 1

Emeric Deutsch, Aug 05 2006

A nondecreasing Dyck path is a Dyck path for which the sequence of the altitudes of the valleys is nondecreasing.
Row n contains 1+floor(n/2) terms.
Row sums are the odd-indexed Fibonacci numbers (A001519).
T(2n,n) = Fibonacci(2n-1) (A001519).
Sum_{k>=0} k*T(n,k) = A121530(n).

			T(4,2)=2 because we have U/UDDU/UDD and U/UU/UDDDD, where U=(1,1) and D=(1,-1) (the double rises at an odd level are indicated by a /).
Triangle starts:
  1;
  1,  1;
  1,  4;
  1, 10,  2;
  1, 19, 14;
  1, 33, 50,  5;

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, A121530, A121531, A054142.

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

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

A121532 Number of double rises at an even 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

0, 0, 1, 6, 24, 87, 290, 926, 2861, 8640, 25634, 75015, 217100, 622620, 1772097, 5011394, 14093980, 39448623, 109954398, 305344314, 845165725, 2332485420, 6420202246, 17629525871, 48304680504, 132092031672, 360557665825

Offset: 1

Emeric Deutsch, Aug 05 2006

nonn

			a(3)=1 because we have UDUDUD, UDUUDD, UUDDUD, UUDUDD and UU/UDDD, the double rises at an odd level being indicated by a / (U=(1,1), 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. A121530, A121531, A054444.

R:=PowerSeriesRing(Integers(), 30); [0,0] cat Coefficients(R!( x^3*(1-3*x^2+2*x^3-x^4)/((1+x)*(1-3*x+x^2)^2*(1-x-x^2)) )); // G. C. Greubel, May 24 2019

g:=z^3*(1-3*z^2+2*z^3-z^4)/(1+z)/(1-3*z+z^2)^2/(1-z-z^2): gser:=series(g,z=0,35): seq(coeff(gser,z,n),n=1..32);

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

my(x='x+O('x^30)); concat([0,0], Vec(x^3*(1-3*x^2+2*x^3-x^4)/((1+x)*(1-3*x+x^2)^2*(1-x-x^2)))) \\ G. C. Greubel, May 24 2019

a=(x^3*(1-3*x^2+2*x^3-x^4)/((1+x)*(1-3*x+x^2)^2*(1-x-x^2)) ).series(x, 30).coefficients(x, sparse=False); a[1:] # G. C. Greubel, May 24 2019

a(n) = Sum_{k>=0} k*A121531(n,k).
a(n) = A054444(n-2) - A121530(n).
G.f.: x^3*(1-3*x^2+2*x^3-x^4)/((1+x)*(1-3*x+x^2)^2*(1-x-x^2)). [Corrected by Georg Fischer, May 24 2019]
a(n) ~ (3-sqrt(5)) * (3+sqrt(5))^n * n / (5 * 2^(n+1)). - Vaclav Kotesovec, Mar 20 2014
Equivalently, a(n) ~ phi^(2*n-2) * n / 5, where phi = A001622 is the golden ratio. - Vaclav Kotesovec, Dec 06 2021

cp's OEIS Frontend

A121529 Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n and having k double rises at an odd level (n >= 1, k >= 0).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Formula