The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A230382 Number of ascending runs of length n in the permutations of [2n]. 2
 1, 2, 21, 312, 5880, 133920, 3575880, 109549440, 3788104320, 145957593600, 6201593798400, 288084016281600, 14525808782284800, 790129980896256000, 46120599397192320000, 2875600728738017280000, 190740227037467627520000, 13411608375592258191360000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..300 FORMULA For n>0, a(n) = (n^2+n+1)*(2*n)!/((n+2)*n!). - Vaclav Kotesovec, Oct 18 2013 MAPLE a:= proc(n) option remember; `if`(n<2, 1+n, 2*(2*n-1)*(n+1)*(n^2+n+1)*a(n-1)/((n+2)*(n^2-n+1))) end: seq(a(n), n=0..25); CROSSREFS A diagonal of A122843. Sequence in context: A094797 A359918 A234525 * A196629 A196637 A240997 Adjacent sequences: A230379 A230380 A230381 * A230383 A230384 A230385 KEYWORD nonn AUTHOR Alois P. Heinz, Oct 17 2013 STATUS approved

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

Last modified January 27 20:03 EST 2023. Contains 359849 sequences. (Running on oeis4.)