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.

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

Original entry on oeis.org

1, 2, 6, 22, 98, 534, 3334, 23724, 191820, 1704532, 16689868, 179288892, 2069311996, 25760882744, 345073745880, 4900331447624
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(j+3k)-p(j)<>3k for all j>=1, k>=1, j+3k<=n.
For information about semi-pieces see semi-bishop (A187235) and semi-queen (A099152).

Crossrefs