A189358 - OEIS

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

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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.

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