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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324366 Number of permutations p of [n] having at least one index i with |p(i)-i| = 3. 3
 0, 0, 0, 0, 10, 67, 455, 3486, 29296, 272064, 2782768, 31112974, 377989835, 4961822943, 70010940186, 1056948399594, 17002714972374, 290376470114307, 5247488148645251, 100046090532522600, 2006982109206921472, 42259647960510173184, 931935465775791556864 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Alois P. Heinz, Table of n, a(n) for n = 0..250 Wikipedia, Permutation FORMULA a(n) = n! - A324365(n). EXAMPLE a(4) = 10: 2341, 2431, 3241, 3421, 4123, 4132, 4213, 4231, 4312, 4321. CROSSREFS Column k=3 of A306506. Cf. A000142, A324365. Sequence in context: A026868 A026886 A079156 * A197783 A197751 A144052 Adjacent sequences:  A324363 A324364 A324365 * A324367 A324368 A324369 KEYWORD nonn AUTHOR Alois P. Heinz, Feb 23 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 August 11 15:10 EDT 2022. Contains 356066 sequences. (Running on oeis4.)