Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128737
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128737 Number of LDU's in all skew Dyck paths of semilength n. 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. +0
2
0, 0, 0, 0, 1, 10, 69, 412, 2291, 12244, 63886, 328256, 1669363, 8429384, 42349096, 211982828, 1058244079, 5272285552, 26227527576, 130323237088, 647013004499, 3210128312122, 15919166804461, 78915323039268, 391100149306301 (list; graph; listen)
OFFSET

0,6

COMMENT

a(n)=Sum(k*A128735(n,k), k>=0).

REFERENCES

E. Deutsch, E. Munarini, and S. Rinaldi, Skew Dyck paths (in preparation).

FORMULA

G.f.=z(g-1)^3/(4g-2zg-6zg^2-3+3*z), where g=1+zg^2+z(g-1)=[1-z-sqrt(1-6z+5z^2)]/(2z).

EXAMPLE

a(4)=1 because among the 36 (=A002212(4)) skew Dyck paths of semilength 4 only UUUDLDUD has a LDU.

MAPLE

g:=(1-z-sqrt(1-6*z+5*z^2))/2/z: ser:=series(z*(g-1)^3/(4*g-2*z*g-6*z*g^2-3+3*z), z=0, 30): seq(coeff(ser, z, n), n=0..27);

CROSSREFS

Cf. A128735.

Sequence in context: A081280 A038806 A016273 this_sequence A130548 A090084 A025221

Adjacent sequences: A128734 A128735 A128736 this_sequence A128738 A128739 A128740

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Mar 31 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research