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

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
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