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.

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

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

Original entry on oeis.org

1, 0, 0, 2, 0, 0, 0, 0, 0, 4, 56, 172, 680, 1348, 6576, 34568, 107624, 413760, 1697288, 8035558, 37441416, 192483420, 1115143224
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+2k)-p(i)|<>4k AND |p(j+4k)-p(j)|<>2k AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+2k<=n, j+4k<=n, m+k<=n

Crossrefs

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

Original entry on oeis.org

1, 0, 0, 2, 2, 4, 28, 0, 20, 20, 180, 520, 1888, 6016, 22480, 105236, 433500, 1933604, 9687268, 50998366, 269523272, 1507984008
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+3k)-p(i)|<>4k AND |p(j+4k)-p(j)|<>3k AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+3k<=n, j+4k<=n, m+k<=n

Crossrefs

Showing 1-3 of 3 results.