Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114627
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114627 Number of hill-free Dyck paths of semilength n+3 and having no peaks at level 2 (a Dyck path is said to be hill-free if it has no peaks at level 1). +0
2
1, 2, 6, 19, 61, 202, 683, 2348, 8184, 28855, 102731, 368813, 1333684, 4853436, 17761181, 65320691, 241300829, 894958140, 3331323651, 12441078958, 46601721324, 175040968111, 659136721385, 2487852579751, 9410480922018 (list; graph; listen)
OFFSET

0,2

COMMENT

Column 0 of A114626.

FORMULA

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

EXAMPLE

a(1)=2 because we have UUUDUDDD and UUUUDDDD, where U=(1,1), D=(1,-1).

MAPLE

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

CROSSREFS

Cf. A114626.

Sequence in context: A052975 A035929 A071646 this_sequence A148464 A148465 A148466

Adjacent sequences: A114624 A114625 A114626 this_sequence A114628 A114629 A114630

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Dec 18 2005

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 December 20 16:54 EST 2009. Contains 171081 sequences.


AT&T Labs Research