login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A288540 Number of Dyck paths of semilength n such that the minimal number of peaks over all positive levels equals one. 2
1, 0, 2, 5, 13, 35, 112, 368, 1208, 3992, 13449, 46187, 160804, 565535, 2005796, 7168058, 25793100, 93388250, 340005973, 1244062960, 4572478054, 16874672868, 62508259095, 232338076267, 866289458048, 3239350667761, 12145345634715, 45649270140732 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Alois P. Heinz, Table of n, a(n) for n = 1..300

Wikipedia, Counting lattice paths

EXAMPLE

: a(3) = 2:

:

:          /\    /\

:       /\/  \  /  \/\  .

CROSSREFS

Column k=1 of A288387.

Cf. A000108.

Sequence in context: A148293 A148294 A148295 * A046171 A022854 A116409

Adjacent sequences:  A288537 A288538 A288539 * A288541 A288542 A288543

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Jun 11 2017

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 19 11:14 EDT 2019. Contains 324219 sequences. (Running on oeis4.)