Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A152173
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A152173 a(n) is the number of Dyck paths of length n without height of peaks 1 (mod 3) and height of valleys 2 (mod 3) +0
1
1, 0, 1, 2, 4, 10, 23, 56, 138, 344, 870, 2220, 5716, 14828, 38717, 101682, 268416, 711810, 1895432, 5066030, 13586082, 36547534, 98593064, 266661162, 722953814, 1964358938, 5348367006, 14589803090, 39870312218, 109136843138 (list; graph; listen)
OFFSET

2,4

REFERENCES

Shu-Chung Liu, Jun Ma and Yeong-Nan Yeh, "Dyck Paths with Peak- and Valley-Avoiding Sets", Stud. Appl Math. 121 (3) (2008) 263-289

FORMULA

gf := (1-x-sqrt(1-2*x-3*x^2+4*x^4))/(2(1+x)x^2) ;

CROSSREFS

Cf. A127389. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Dec 03 2008]

Sequence in context: A094987 A137681 A127389 this_sequence A032171 A127713 A151256

Adjacent sequences: A152170 A152171 A152172 this_sequence A152174 A152175 A152176

KEYWORD

nonn

AUTHOR

Jun Ma (majun(AT)math.sinica.edu.tw), Nov 27 2008

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 11 12:57 EST 2009. Contains 170656 sequences.


AT&T Labs Research