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.

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

Original entry on oeis.org

1, 2, 6, 24, 120, 392, 1810, 10400, 72228, 589674, 3823906, 29420944, 266232984, 2711139976, 30669073348, 316482938974
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 for all i>=1, j>=1, k>=1, i+2k<=n, j+5k<=n

Crossrefs