Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A001558
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A001558 Number of hill-free Dyck paths of semilength n+3 and having length of first descent equal to 1 (a hill in a Dyck path is a peak at level 1).
(Formerly M2845 N1143)
+0
5
1, 3, 10, 33, 111, 379, 1312, 4596, 16266, 58082, 209010, 757259, 2760123, 10114131, 37239072, 137698584, 511140558, 1904038986, 7115422212, 26668376994, 100221202998, 377570383518, 1425706128480, 5394898197448, 20454676622476 (list; graph; listen)
OFFSET

0,2

COMMENT

a(n)=A000957(n+4)-A000957(n+3)-A000957(n+2) (A000957 are the Fine numbers). a(n)=A118972(n+3,1). - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 08 2006

Contribution from Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 05 2008: (Start)

a(n) is also the number of even-length descents to ground level in all Dyck paths of semilength n+2. Example: a(1)=3 because in UDUDUD, UDUU(DD), UU(DD)UD, UUDU(DD) and UUUDDD we have 3 even-length descentts to ground level (shown between parentheses).

a(n)=Sum(k*A111301(n+2,k),k>=0). (End)

Convolution of A000108 with A104629. [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Nov 11 2009]

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

T. Fine, Extrapolation when very little is known about the source. Information and Control 16 (1970), 331-359.

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

FORMULA

G.f. = F*C^3, where F=[1-sqrt(1-4z)]/[z(3-sqrt(1-4z))] and C=[1-sqrt(1-4z)]/(2z) is the Catalan function. - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 08 2006

EXAMPLE

a(1)=3 because we have uu(d)ududd, uuu(d)uddd and uu(d)uuddd, where u=(1,1), d=(1,-1) (the first descents are shown between parentheses).

MAPLE

F:=(1-sqrt(1-4*z))/z/(3-sqrt(1-4*z)): C:=(1-sqrt(1-4*z))/2/z: g:=F*C^3: gser:=series(g, z=0, 32): seq(coeff(gser, z, n), n=0..27); - Emeric Deutsch (deutsch(AT)duke.poly.edu), May 08 2006

CROSSREFS

Cf. A000957, A118972, A118973.

A111301 [From Emeric Deutsch (deutsch(AT)duke.poly.edu), Oct 05 2008]

Sequence in context: A126931 A071722 A058987 this_sequence A111639 A149029 A149030

Adjacent sequences: A001555 A001556 A001557 this_sequence A001559 A001560 A001561

KEYWORD

nonn,easy,new

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Edited by 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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research