A189878 -id:A189878 - cp's OEIS frontend

Showing 1-2 of 2 results.

A189880 Number of ways to place n nonattacking composite pieces queen + rider[3,5] on an n X n chessboard.

Original entry on oeis.org

1, 0, 0, 2, 10, 0, 8, 24, 72, 116, 336, 1124, 4056, 12628, 58984, 263066, 1124116, 5388972, 29219680, 173696136, 967249940

Offset: 1

Vaclav Kotesovec, Apr 29 2011

a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+3k)-p(i)|<>5k AND |p(j+5k)-p(j)|<>3k AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+3k<=n, j+5k<=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. A102388, A189875, A189878, A189859, A189879

A189881 Number of ways to place n nonattacking composite pieces queen + rider[4,5] on an n X n chessboard.

Original entry on oeis.org

1, 0, 0, 2, 10, 4, 12, 32, 96, 144, 528, 1712, 7472, 24500, 103536, 486020, 2218808, 11113020, 59242576, 342584556, 1981826412

Offset: 1

Vaclav Kotesovec, Apr 29 2011

a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+4k)-p(i)|<>5k AND |p(j+5k)-p(j)|<>4k AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+4k<=n, j+5k<=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. A102388, A189875, A189878, A189880, A189861

Showing 1-2 of 2 results.