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!)
A306675 Number of permutations p of [2n] having at least one index i with |p(i)-i| = n. 3
0, 1, 15, 455, 25487, 2293839, 302786759, 55107190151, 13225725636255, 4047072044694047, 1537887376983737879, 710503968166486900119, 392198190427900768865711, 254928823778135499762712175, 192726190776270437820610404327, 167671785975355280903931051764519 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
Wikipedia, Permutation
FORMULA
a(n) = A306506(2n,n).
a(n) = (2n)! - A306535(n).
MAPLE
b:= proc(n, k) b(n, k):= `if`(k=0, n!, b(n+1, k-1) -b(n, k-1)) end:
a:= n-> (2*n)! -b(0, 2*n):
seq(a(n), n=0..16);
MATHEMATICA
b[n_, k_] := b[n, k] = If[k == 0, n!, b[n + 1, k - 1] - b[n, k - 1]];
a[n_] := (2n)! - b[0, 2n];
a /@ Range[0, 16] (* Jean-François Alcover, Apr 02 2021, after Alois P. Heinz *)
CROSSREFS
Sequence in context: A041420 A036506 A369828 * A219561 A209488 A361307
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Mar 04 2019
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 September 15 04:39 EDT 2024. Contains 375931 sequences. (Running on oeis4.)