login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A191307 Sum of the heights of the first peaks in all dispersed Dyck paths of length n (i.e. in Motzkin paths of length n with no (1,0)-steps at positive heights). 1
0, 0, 1, 2, 6, 11, 26, 47, 103, 187, 397, 727, 1519, 2806, 5809, 10814, 22254, 41702, 85460, 161042, 329002, 622932, 1269578, 2413644, 4909788, 9367188, 19024888, 36408748, 73850908, 141714823, 287137498, 552320023, 1118042743, 2155201063, 4359162493, 8419091443 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

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

LINKS

Table of n, a(n) for n=0..35.

FORMULA

G.f.: ((1-z-z^2)*sqrt(1-4*z^2) - (1-2*z)*(1+z-z^2))/(2*z^3*(1-z)*(1-2*z)).

EXAMPLE

a(4)=6 because, denoting U=(1,1), D=(1,-1), H=(1,0), in HHHH, HHUD, HUDH, UDHH, UDUD, and UUDD the sum of the heights of the first peaks is 0+1+1+1+1+2=6.

MAPLE

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

CROSSREFS

Cf. A191306

Sequence in context: A079118 A211054 A034466 * A007186 A033304 A091622

Adjacent sequences:  A191304 A191305 A191306 * A191308 A191309 A191310

KEYWORD

nonn

AUTHOR

Emeric Deutsch, May 30 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 19 07:18 EDT 2013. Contains 225429 sequences.