login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A241804
Number of ballot sequences of length 2n having exactly n descents.
2
1, 0, 0, 1, 9, 112, 1582, 26159, 486170, 10131071, 233582056, 5895589738, 161776346286, 4794754890798, 152576687930997, 5187562649814737, 187666786444911220, 7196725552061993554, 291572346138097726746, 12443163766976461627878, 557880276243757014820691
OFFSET
0,5
FORMULA
a(n) = A238121(2n,n) = A238122(2n,n).
EXAMPLE
a(3) = 1: [1,2,1,3,2,1].
a(4) = 9: [1,2,1,2,1,3,2,1], [1,2,1,3,1,4,2,1], [1,2,1,3,2,1,2,1], [1,2,1,3,2,1,3,1], [1,2,1,3,2,1,3,2], [1,2,1,3,2,1,4,1], [1,2,1,3,2,1,4,2], [1,2,1,3,2,1,4,3], [1,2,1,3,2,4,3,1].
CROSSREFS
Sequence in context: A201532 A180788 A348068 * A156949 A155624 A165224
KEYWORD
nonn
AUTHOR
Joerg Arndt and Alois P. Heinz, Apr 28 2014
STATUS
approved