cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-3 of 3 results.

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

Original entry on oeis.org

1, 0, 0, 2, 10, 0, 0, 4, 8, 28, 100, 186, 624, 1720, 7288, 30666, 100220, 360208, 1517804, 7302336, 29429672, 139854636, 753288744
Offset: 1

Views

Author

Vaclav Kotesovec, Apr 29 2011

Keywords

Comments

(in fairy chess the rider [1,4] is called a Girafferider)
a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+k)-p(i)|<>4k AND |p(j+4k)-p(j)|<>k AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+k<=n, j+4k<=n, m+k<=n

Crossrefs

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

Original entry on oeis.org

1, 0, 0, 2, 10, 0, 0, 0, 40, 52, 152, 260, 1192, 4144, 18408, 71552, 312936, 1498156, 7854672, 44923706, 213840604, 1156549592
Offset: 1

Views

Author

Vaclav Kotesovec, Apr 29 2011

Keywords

Comments

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

Crossrefs

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

Original entry on oeis.org

1, 0, 0, 2, 10, 0, 0, 0, 0, 16, 60, 40, 304, 620, 2512, 8734, 28410, 94312, 345824, 1391072, 5759566, 25227796, 121663032, 635977968
Offset: 1

Views

Author

Vaclav Kotesovec, Apr 29 2011

Keywords

Comments

(in fairy chess the rider [2,3] is called a Zebrarider)
a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+2k)-p(i)|<>3k AND |p(j+3k)-p(j)|<>2k AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+2k<=n, j+3k<=n, m+k<=n

Crossrefs

Showing 1-3 of 3 results.