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

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

Original entry on oeis.org

1, 2, 6, 24, 120, 720, 4176, 26140, 185084, 1491098, 13285034, 132514356, 1321161252, 14181339764, 164574628260, 2057033314380
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+5k)-p(i)|<>6k AND |p(j+6k)-p(j)|<>5k for all i>=1, j>=1, k>=1, i+5k<=n, j+6k<=n

Links

Crossrefs

Cf. A000170, A189853, A189857, A189860, A189862
Showing 1-1 of 1 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.