%N Triangle read by rows: T(n,k) is the number of nondecreasing Dyck paths of semilength n, having k peaks at odd level (0<=k<=n).
%C Row sums are the odd-subscripted Fibonacci numbers (A001519). T(n,0)=A121482(n). Sum(k*T(n,k),k=0..n)=A121483(n).
%H E. Barcucci, A. Del Lungo, S. Fezzi and R. Pinzani, <a href="http://dx.doi.org/10.1016/S0012-365X(97)82778-1">Nondecreasing Dyck paths and q-Fibonacci numbers</a>, Discrete Math., 170, 1997, 211-217.
%F G.f.: G(t,z) = (tz^2+z^2+z-1)(tz^3+2z^2-1)/(1-4z^2-z-tz+2tz^4+4z^4-z^6+2z^3+tz^3+t^2*z^3).
%e T(3,1)=3 because we have U|DUUDUDD, UUDUU|DDD and UUU|DDUDD, where U=(1,1) and D=(1,-1) (the peaks at odd level are shown by a |; the Dyck path UUDUDDUD has 1 peak at odd level but it is not nondecreasing).
%e Triangle starts:
%p G:=(t*z^2+z^2+z-1)*(t*z^3+2*z^2-1)/(1-4*z^2-z-t*z+2*z^4*t+4*z^4-z^6+2*z^3+t*z^3+z^3*t^2): Gser:=simplify(series(G,z=0,15)): P:=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) od; # yields sequence in triangular form
%Y Cf. A001519, A121482, A121483, A121484.
%A _Emeric Deutsch_, Aug 02 2006