A189564 Number of permutations p of 1,2,...,n satisfying |p(i+1)-p(i)|<>5 and |p(j+5)-p(j)|<>1 for all i=1..n-1, j=1..n-5.

1, 1, 2, 6, 24, 120, 336, 1474, 8340, 57756, 475658, 4171070, 41950294, 472535256, 5882635676, 79963449714, 1173614446044

Offset

0,3

Comments

a(n) is also the number of ways to place n nonattacking pieces rook + leaper[1,5] on an n X n chessboard.

Links

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

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.

Crossrefs

Cf. A137774, A189358, A189563.

Sequence in context: A263702 A263696 A189852 * A276839 A364425 A178010

Adjacent sequences: A189561 A189562 A189563 * A189565 A189566 A189567

Keyword

nonn,more,hard

Author

Vaclav Kotesovec, Apr 23 2011

Status

approved