login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A323802 Number of permutations p of [n] such that max_{j=1..n} |p(j)-j| = 6. 2
0, 1320, 13656, 96090, 569602, 3111243, 16447329, 87358763, 475067757, 2607565996, 14310288148, 78087401424, 422646322560, 2269565277936, 12114270563852, 64454693890844, 342374934748155, 1817028234672099, 9636622425425550, 51069856507725138, 270408018010461065 (list; graph; refs; listen; history; text; internal format)
OFFSET

6,2

LINKS

Alois P. Heinz, Table of n, a(n) for n = 6..1000

FORMULA

a(n) = A154655(n) - A154654(n).

CROSSREFS

Column k=6 of A130152.

Cf. A154654, A154655.

Sequence in context: A157266 A069737 A185464 * A161586 A013641 A295449

Adjacent sequences:  A323799 A323800 A323801 * A323803 A323804 A323805

KEYWORD

nonn,easy

AUTHOR

Alois P. Heinz, Jan 28 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 17:12 EST 2021. Contains 349424 sequences. (Running on oeis4.)