Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116914
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116914 Number of UUDD's, where U=(1,1) and D=(1,-1), in all hill-free Dyck paths of semilength n (a hill in a Dyck path is a peak at level 1). +0
3
1, 1, 5, 16, 58, 211, 781, 2920, 11006, 41746, 159154, 609324, 2341060, 9021559, 34855741, 134972368, 523689718, 2035462990, 7923732118, 30889008112, 120566373676, 471134916286, 1842964183570, 7216096752496, 28279240308268 (list; graph; listen)
OFFSET

2,3

COMMENT

a(n)=Sum(k*A105640(n,k), k=0..floor(n/2)).

REFERENCES

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

FORMULA

G.f.=z[1+5z-(1-z)sqrt(1-4z)]/[2(2+z)^2*sqrt(1-4z)].

a(n+2)=A126258(2*n,n). - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 13 2007

EXAMPLE

a(4)=5 because in the 6 (=A000957(5)) hill-free Dyck paths of semilength 4, namely UU(UUDD)DD, UUUDUDDD, UUD(UUDD)D, UUDUDUDD, U(UUDD)UDD, and (UUDD)(UUDD) (U=(1,1), D=(1,-1)) we have altogether 5 UUDD's (shown between parentheses).

MAPLE

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

CROSSREFS

Cf. A105640.

Sequence in context: A120343 A057553 A006217 this_sequence A047103 A077235 A098347

Adjacent sequences: A116911 A116912 A116913 this_sequence A116915 A116916 A116917

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research