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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A189358 Number of permutations p of 1,2,...,n satisfying |p(i+1)-p(i)|<>3 and |p(j+3)-p(j)|<>1 for all i=1..n-1, j=1..n-3. 10
1, 1, 2, 6, 8, 24, 126, 524, 3072, 22854, 189646, 1827114, 19889946, 238648524, 3131979014, 44540692612, 681114241416, 11136984461270 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

a(n) is also the number of ways to place n nonattacking pieces rook + leaper[1,3] on an n X n chessboard (in fairy chess the leaper[1,3] is called a camel).

LINKS

Table of n, a(n) for n=0..17.

V. Kotesovec, Number of ways of placing non-attacking queens, kings, bishops and knights (in English and Czech)

FORMULA

Asymptotic: a(n)/n! ~ 1/e^4.

MATHEMATICA

A189358[n_] := Module[{p, c = 0, i = 1, q},

   p=Permutations[Range[n]]; While[i <= Length[p], q = p[[i]]; i++;

    If[AllTrue[Range[n - 1], Abs[q[[# + 1]] - q[[#]]] != 3 &] &&

       AllTrue[Range[n - 3], Abs[q[[# + 3]] - q[[#]]] != 1 &], c++]]; c];

Table[A189358[n], {n, 0, 9}]  (* Robert Price, Apr 04 2019 *)

CROSSREFS

Cf. A137774.

Sequence in context: A122756 A193946 A189850 * A116083 A115506 A243552

Adjacent sequences:  A189355 A189356 A189357 * A189359 A189360 A189361

KEYWORD

nonn,more,hard

AUTHOR

Vaclav Kotesovec, Apr 23 2011

EXTENSIONS

a(17) from Alois P. Heinz, Mar 19 2017

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 May 11 19:29 EDT 2021. Contains 343808 sequences. (Running on oeis4.)