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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A077613 Number of adjacent pairs of form (even,odd) among all permutations of {1,2,...,n}. Also, number of adjacent pairs of form (odd,even). 9
0, 1, 4, 24, 144, 1080, 8640, 80640, 806400, 9072000, 108864000, 1437004800, 20118067200, 305124019200, 4881984307200, 83691159552000, 1506440871936000, 28810681675776000, 576213633515520000, 12164510040883200000, 267619220899430400000, 6182004002776842240000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
FORMULA
a(n) = floor(n/2)*ceiling(n/2)*(n-1)!. Proof: There are floor(n/2)*ceiling(n/2) pairs (r, s) with r even and s odd. For each pair, there are n-1 places it can occur in a permutation and (n-2)! possible arrangements of the other numbers.
a(n) = A002620(n) * A000142(n-1). - Michel Marcus, Aug 29 2013
Sum_{n>=2} 1/a(n) = 6*(CoshIntegral(1) - gamma) + 2/e - 1 = 6*(A099284 - A001620) + 2*A068985 - 1. - Amiram Eldar, Jan 22 2023
MATHEMATICA
Array[Floor[#/2] Ceiling[#/2] (# - 1)! &, 19] (* Michael De Vlieger, Aug 16 2017 *)
PROG
(PARI) a(n) = floor(n/2)*ceil(n/2)*(n-1)!; \\ Michel Marcus, Aug 29 2013
CROSSREFS
Sequence in context: A067411 A045915 A052609 * A072949 A104531 A225050
KEYWORD
nonn
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)