Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A121482
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A121482 Number of nondecreasing Dyck paths of semilength n and having no peaks at odd level (n>=0). A nondecreasing Dyck path is a Dyck path for which the sequence of the altitudes of the valleys is nondecreasing. +0
3
1, 0, 1, 1, 3, 5, 12, 22, 49, 94, 201, 396, 828, 1656, 3421, 6899, 14160, 28686, 58672, 119156, 243253, 494688, 1008860, 2053168, 4184892, 8520248, 17361293, 35354517, 72028485, 146696143, 298840769, 608670551, 1239888694, 2525459305 (list; graph; listen)
OFFSET

0,5

COMMENT

Column 0 of A121481.

REFERENCES

E. Barcucci, A. Del Lungo, S. Fezzi and R. Pinzani, Nondecreasing Dyck paths and q-Fibonacci numbers, Discrete Math., 170, 1997, 211-217.

FORMULA

G.f.=(1-z-z^2)(1-2z^2)/(1-z-4z^2+2z^3+4z^4-z^6).

EXAMPLE

a(4)=3 because we have UUDDUUDD, UUDUDUDD, and UUUUDDDD, where U=(1,1) and D=(1,-1).

MAPLE

G:=(1-z-z^2)*(1-2*z^2)/(1-z-4*z^2+2*z^3+4*z^4-z^6): Gser:=series(G, z=0, 40): seq(coeff(Gser, z, n), n=0..37);

CROSSREFS

Cf. A121481.

Sequence in context: A024458 A089292 A034763 this_sequence A013498 A034758 A131322

Adjacent sequences: A121479 A121480 A121481 this_sequence A121483 A121484 A121485

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Aug 02 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 September 7 15:23 EDT 2008. Contains 143483 sequences.


AT&T Labs Research