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”).

A230346
Number of permutations of [2n+6] in which the longest increasing run has length n+6.
3
1, 14, 231, 4512, 103194, 2721600, 81591840, 2746068480, 102661518960, 4224849995520, 189917647920000, 9263565222912000, 487461283781472000, 27533206366009344000, 1661865400404937728000, 106768864984887705600000, 7275718977990226283520000
OFFSET
0,2
COMMENTS
Also the number of ascending runs of length n+6 in the permutations of [2n+6].
LINKS
FORMULA
a(n) = (n+5)*(n^2+9*n+11)*(2*n+6)!/(n+8)! for n>0, a(0) = 1.
a(n) = A008304(2*n+6,n+6) = A122843(2*n+6,n+6).
MAPLE
a:= proc(n) option remember; `if`(n<2, 1+13*n, 2*(2*n+5)*(n+5)*
(n+3)*(n^2+9*n+11)*a(n-1)/((n+4)*(n+8)*(n^2+7*n+3)))
end:
seq(a(n), n=0..25);
CROSSREFS
A diagonal of A008304, A122843.
Sequence in context: A273625 A120048 A079563 * A280559 A305862 A222377
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Oct 16 2013
STATUS
approved