|
%I
%S 1,0,1,0,0,2,0,0,1,4,0,0,1,5,8,0,0,1,7,18,16,0,0,1,9,34,56,32,0,0,1,
%T 11,55,138,160,64,0,0,1,13,81,275,500,432,128,0,0,1,15,112,481,1205,
%U 1672,1120,256,0,0,1,17,148,770,2471,4797,5264,2816,512,0,0,1,19,189,1156
%N Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having pyramid weight k.
%C A pyramid in a Dyck word (path) is a factor of the form u^h d^h, h being the height of the pyramid. A pyramid in a Dyck word w is maximal if, as a factor in w, it is not immediately preceded by a u and immediately followed by a d. The pyramid weight of a Dyck path (word) is the sum of the heights of its maximal pyramids.
%C Triangle T(n,k), 0<=k<=n, read by rows, given by [0, 0, 1, 0, 0, 1, 0, 0, 1, ...](periodic sequence 0,0,1) DELTA [1, 1, 0, 1, 1, 0, 1, 1, 0, ...](periodic sequence 1,1,0), where DELTA is the operator defined in A084938 . - _Philippe DELEHAM_, Aug 18 2006
%D A. Denise and R. Simion, Two combinatorial statistics on Dyck paths, Discrete Math., 137, 1995, 155-176).
%F G.f. = G = G(t, z) satisfies z(1-tz)G^2-(1+z-2tz)G+1-tz = 0.
%F Sum_{k, 0<=k<=n}T(n,k) = A000108(n) . - _Philippe DELEHAM_, Aug 18 2006
%e T(4,3)=5 because the Dyck paths of semilength 4 having pyramid weight 3 are: (ud)u(ud)(ud)d, u(ud)(ud)d(ud), u(ud)(ud)(ud)d, u(ud)(uudd)d and u(uudd)(ud)d [here u=(1,1), d=(1,-1) and the maximal pyramids, of total length 3, are shown between parentheses].
%e Triangle begins:
%e .[1],
%e .[0, 1],
%e .[0, 0, 2],
%e .[0, 0, 1, 4],
%e .[0, 0, 1, 5, 8],
%e .[0, 0, 1, 7, 18, 16],
%e .[0, 0, 1, 9, 34, 56, 32],
%e .[0, 0, 1, 11, 55, 138, 160, 64]
%K nonn,tabl
%O 0,6
%A _Emeric Deutsch_, Mar 10 2004
|
