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

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

Original entry on oeis.org

1, 2, 6, 8, 24, 126, 316, 1344, 7782, 33930, 172430, 1106754, 6432236, 45188572, 372437930, 2728674526, 23648822368, 233010291526, 2083328647344
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 for all i>=1, j>=1, k>=1, i+k<=n, j+3k<=n

Links

Crossrefs

Cf. A000170, A189837

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

Original entry on oeis.org

1, 2, 6, 24, 48, 182, 868, 5752, 22952, 131766, 912964, 7556978, 52602390, 432795244, 4121203656, 44335718598, 416447624724
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 for all i>=1, j>=1, k>=1, i+k<=n, j+4k<=n

Links

Crossrefs

Cf. A000170, A189837, A189850

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

Original entry on oeis.org

1, 2, 6, 24, 120, 336, 1474, 8340, 57756, 475658, 2812910, 20852460, 181255892, 1817101242, 20435345782, 197871434994
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 for all i>=1, j>=1, k>=1, i+k<=n, j+5k<=n

Links

Crossrefs

Cf. A000170, A189837, A189850, A189851

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

Original entry on oeis.org

1, 2, 6, 24, 120, 720, 2640, 13596, 87768, 680274, 6090756, 61678252, 482005340, 4454053680, 46705656280, 549750105234
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)|<>6k AND |p(j+6k)-p(j)|<>k for all i>=1, j>=1, k>=1, i+k<=n, j+6k<=n

Links

Crossrefs

Cf. A000170, A189837, A189850, A189851, A189852

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

Original entry on oeis.org

1, 2, 6, 12, 36, 174, 500, 2052, 12112, 65092, 407882, 2954798, 20568796, 157579774, 1346294112, 11580692142, 110130002110, 1145065547108
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 for all i>=1, j>=1, k>=1, i+2k<=n, j+3k<=n

Links

Crossrefs

Cf. A000170, A189837, A189850

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

Original entry on oeis.org

1, 2, 6, 24, 60, 208, 1184, 7840, 36036, 209664, 1395480, 10996728, 83573220, 723835856, 7132494776, 77976981216, 790552134804
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 for all i>=1, j>=1, k>=1, i+2k<=n, j+4k<=n

Links

Crossrefs

Cf. A000170, A189851, A189854, A189837
Showing 1-6 of 6 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.