This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A152663 Number of leading odd entries in all permutations of {1,2,...,n} (see example). 2
 1, 1, 6, 16, 120, 540, 5040, 32256, 362880, 3024000, 39916800, 410572800, 6227020800, 76281004800, 1307674368000, 18598035456000, 355687428096000, 5762136335155200, 121645100408832000, 2211729098342400000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS a(n) = Sum_{k=0..ceiling(n/2)} k*A152662(n,k). LINKS FORMULA a(2n+1) = (2n+1)!; a(2n) = n(2n)!/(n+1). EXAMPLE a(3)=6 because in the permutations 123, 132, 213, 231, 312, 321 we have 1+2+0+0+2+1 = 6 leading odd entries. MAPLE ao := proc (n) options operator, arrow; factorial(2*n+1) end proc: ae := proc (n) options operator, arrow: n*factorial(2*n)/(n+1) end proc: a := proc (n) if `mod`(n, 2) = 1 then ao((1/2)*n-1/2) else ae((1/2)*n) end if end proc: seq(a(n), n = 1 .. 20); CROSSREFS Cf. A152662, A152664, A152665. Sequence in context: A239027 A218976 A173737 * A229560 A113561 A080809 Adjacent sequences:  A152660 A152661 A152662 * A152664 A152665 A152666 KEYWORD nonn AUTHOR Emeric Deutsch, Dec 13 2008 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.

Last modified December 14 22:42 EST 2019. Contains 329987 sequences. (Running on oeis4.)