A189868 -id:A189868 - cp's OEIS frontend

Showing 1-2 of 2 results.

A189869 Number of ways to place n nonattacking composite pieces queen + leaper[2,5] on an n X n chessboard.

Original entry on oeis.org

1, 0, 0, 2, 10, 4, 28, 20, 56, 72, 288, 1304, 6368, 22884, 125864, 755412, 4565572, 29862256, 207238124, 1540506028, 11774180220

Offset: 1

Vaclav Kotesovec, Apr 29 2011

a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+2)-p(i)|<>5 AND |p(j+5)-p(j)|<>2 AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+2<=n, j+5<=n, m+k<=n

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

Cf. A051223, A189866, A189867, A189868, A189567

A189870 Number of ways to place n nonattacking composite pieces queen + leaper[3,4] on an n X n chessboard.

Original entry on oeis.org

1, 0, 0, 2, 2, 4, 28, 0, 20, 52, 280, 1192, 5520, 20196, 115936, 701836, 4174032, 27261284, 193428616, 1445733328, 11133210948

Offset: 1

Vaclav Kotesovec, Apr 29 2011

a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+3)-p(i)|<>4 AND |p(j+4)-p(j)|<>3 AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+3<=n, j+4<=n, m+k<=n

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

Cf. A051223, A189865, A189868, A189568

Showing 1-2 of 2 results.