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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A306545 Number of permutations p of [2n+2] such that min_{j=1..2n+2} |p(j)-j| = n; 2
 1, 8, 28, 111, 435, 1707, 6723, 26571, 105315, 418347, 1664643, 6632331, 26450595, 105566187, 421556163, 1684098891, 6730018275, 26900941227, 107546369283, 430013290251, 1719536600355, 6876596719467, 27501737832003, 109993004190411, 439930175348835 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..1660 Wikipedia, Permutation Index entries for linear recurrences with constant coefficients, signature (8,-19,12). FORMULA G.f.: (17*x^4-27*x^3+17*x^2-1)/(12*x^3-19*x^2+8*x-1). a(n) = A299789(2n+2,n). EXAMPLE a(1) = 8: 2143, 2341, 2413, 3142, 3421, 4123, 4312, 4321. CROSSREFS Cf. A299789. Sequence in context: A260935 A289608 A317607 * A358285 A295914 A054857 Adjacent sequences: A306542 A306543 A306544 * A306546 A306547 A306548 KEYWORD nonn,easy 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.

Last modified October 4 16:17 EDT 2023. Contains 365887 sequences. (Running on oeis4.)