Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118974
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118974 Sum of the lengths of the first descents in all hill-free Dyck paths of semilength n (a hill in a Dyck path is a peak at level 1). +0
2
0, 0, 2, 4, 11, 31, 94, 298, 977, 3283, 11243, 39087, 137569, 489171, 1754596, 6340756, 23063731, 84372061, 310216081, 1145748061, 4248861631, 15814069951, 59054807821, 221197379221, 830819449003, 3128511421663, 11808294045071 (list; graph; listen)
OFFSET

0,3

COMMENT

a(n)=Sum(k*A118972(n,k),k=1..n).

REFERENCES

E. Deutsch and L. Shapiro, A survey of the Fine numbers, Discrete Math., 241, 241-265, 2001.

FORMULA

G.f.=z^2*CF(1+C-zC)/(1-z), where F=[1-sqrt(1-4z)]/[z(3-sqrt(1-4z)] and C=[1-sqrt(1-4z)]/(2z) is the Catalan function.

EXAMPLE

a(4)=11 because in the hill-free Dyck paths of semilength 4, namely uu(dd)uudd, uu(d)uuddd, uu(d)ududd, uuu(dd)udd, uuu(d)uddd and uuuu(dddd), the sum of the lengths of the first descents (shown between parentheses) is 2+1+1+2+1+4=11.

MAPLE

F:=(1-sqrt(1-4*z))/z/(3-sqrt(1-4*z)): C:=(1-sqrt(1-4*z))/2/z: g:=series(z^2*C*F*(1+C-z*C)/(1-z), z=0, 32): seq(coeff(g, z, n), n=0..28);

CROSSREFS

Cf. A000957, A118972.

Sequence in context: A148162 A148163 A039300 this_sequence A119020 A073191 A148164

Adjacent sequences: A118971 A118972 A118973 this_sequence A118975 A118976 A118977

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), May 08 2006

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research