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.

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

Original entry on oeis.org

1, 2, 5, 18, 71, 356, 2097, 14212, 105821, 887576, 8093601, 81310936, 876456695, 10257217440, 127631146697, 1705775408656
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+2k)-p(j)<>2k for all j>=1, k>=1, j+2k<=n
about semi-pieces see semi-bishop (A187235) and semi-queen (A099152)

Crossrefs