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-10 of 10 results.

A189837 Number of ways to place n nonattacking composite pieces rook + rider[1,2] on an n X n chessboard.

Original entry on oeis.org

1, 2, 2, 8, 12, 22, 58, 276, 648, 2304, 6508, 24528, 96402, 466922, 2271738, 13723826, 76579326, 512425626, 3281233020, 24654941268, 175398054696
Offset: 1

Views

Author

Vaclav Kotesovec, Apr 29 2011

Keywords

Comments

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

Links

Crossrefs

Cf. A102388, A000170.

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

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 4, 56, 18, 116, 112, 408, 916, 2400, 7228, 27368, 111478, 445644, 1674860, 7624368, 38737270, 178933064
Offset: 1

Views

Author

Vaclav Kotesovec, Apr 29 2011

Keywords

Comments

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

Links

Crossrefs

Cf. A102388, A189850

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

Links

Crossrefs

Cf. A102388, A189873, A189851

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

Links

Crossrefs

Cf. A102388, A189873, A189874, A189852

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

Links

Crossrefs

Cf. A102388, A189873, A189854

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

Links

Crossrefs

Cf. A102388, A189874, A189876, A189855

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

Original entry on oeis.org

1, 0, 0, 2, 10, 4, 28, 20, 56, 72, 200, 644, 2940, 9152, 39200, 166100, 739924, 3586840, 18640500, 107580592, 547737844, 3080550788
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)|<>5k AND |p(j+5k)-p(j)|<>2k AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+2k<=n, j+5k<=n, m+k<=n

Links

Crossrefs

Cf. A102388, A189875, A189876, A189877, A189856

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

Links

Crossrefs

Cf. A102388, A189874, A189877, A189858

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

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)|<>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

Links

Crossrefs

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

Views

Author

Vaclav Kotesovec, Apr 29 2011

Keywords

Comments

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

Links

Crossrefs

Cf. A102388, A189875, A189878, A189880, A189861
Showing 1-10 of 10 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.