login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A129162 Sum of heights of all skew Dyck paths of semilength n. 1
1, 5, 23, 103, 462, 2086, 9493, 43521, 200855, 932429, 4350995, 20395349, 95987113, 453354623, 2148027772, 10206485598, 48621125308, 232156538970, 1110842790406, 5325499426116, 25576096186920, 123030491611330 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A skew Dyck path is a path in the first quadrant which begins at the origin, ends on the x-axis, consists of steps U=(1,1)(up), D=(1,-1)(down) and L=(-1,-1)(left) so that up and left steps do not overlap. The length of the path is defined to be the number of its steps.
LINKS
E. Deutsch, E. Munarini, S. Rinaldi, Skew Dyck paths, J. Stat. Plann. Infer. 140 (8) (2010) 2191-2203
FORMULA
a(n) = Sum_{k=1..n} k*A129161(n,k).
EXAMPLE
a(2)=5 because the paths UDUD, UUDD and UUDL have heights 1, 2 and 2, respectively.
MAPLE
H[0]:=1: for k from 1 to 32 do H[k]:=simplify((1+z*H[k-1]-z)/(1-z*H[k-1])) od: for k from 1 to 32 do h[k]:=factor(simplify(H[k]-H[k-1])) od: for k from 1 to 32 do hser[k]:=series(h[k], z=0, 30) od: T:=(n, k)->coeff(hser[k], z, n): seq(add(k*T(n, k), k=1..n), n=1..25);
CROSSREFS
Cf. A129161.
Sequence in context: A289803 A102285 A218985 * A167660 A290924 A026760
KEYWORD
nonn
AUTHOR
Emeric Deutsch, Apr 03 2007
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 18:58 EDT 2024. Contains 371781 sequences. (Running on oeis4.)