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.

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

Original entry on oeis.org

1, 2, 6, 24, 120, 720, 2952, 16064, 104800, 816160, 7327728, 74031176, 621684168, 5950876288, 64694543120, 777746708096
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)|<>6k AND |p(j+6k)-p(j)|<>2k for all i>=1, j>=1, k>=1, i+2k<=n, j+6k<=n.

Crossrefs