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!)
A306535 Number of permutations p of [2n] having no index i with |p(i)-i| = n. 4
1, 1, 9, 265, 14833, 1334961, 176214841, 32071101049, 7697064251745, 2355301661033953, 895014631192902121, 413496759611120779881, 228250211305338670494289, 148362637348470135821287825, 112162153835443422680893595673, 97581073836835777732377428235481 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Also 0th term of the 2n-th forward differences of n!.
LINKS
Wikipedia, Permutation
FORMULA
a(n) = A306512(2n,n).
a(n) = (2n)! - A306675(n).
a(n) = KummerU(-2*n, -2*n, -1). - Peter Luschny, May 10 2022
MAPLE
b:= proc(n, k) b(n, k):= `if`(k=0, n!, b(n+1, k-1) -b(n, k-1)) end:
a:= n-> b(0, 2*n):
seq(a(n), n=0..23);
seq(simplify(KummerU(-2*n, -2*n, -1)), n=0..15); # Peter Luschny, May 10 2022
MATHEMATICA
b[n_, k_] := b[n, k] = If[k == 0, n!, b[n + 1, k - 1] - b[n, k - 1]];
a[n_] := b[0, 2n];
a /@ Range[0, 23] (* Jean-François Alcover, Apr 02 2021, after Alois P. Heinz *)
CROSSREFS
Sequence in context: A081059 A202884 A188963 * A144684 A191960 A168600
KEYWORD
nonn
AUTHOR
Alois P. Heinz, Feb 22 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 July 13 18:16 EDT 2024. Contains 374285 sequences. (Running on oeis4.)