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

1, 2, 6, 24, 80, 326, 1566, 9544, 53696, 347382, 2566892, 21907934, 184868860, 1704360992, 17294597926, 192725663600, 2139133978996

Offset

1,2

Comments

a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+3k)-p(i)|<>4k AND |p(j+4k)-p(j)|<>3k for all i>=1, j>=1, k>=1, i+3k<=n, j+4k<=n.

Links

Table of n, a(n) for n=1..17.

Vaclav Kotesovec, Non-attacking chess pieces, 6ed, 2013, p. 668.

Wikipedia, Fairy chess piece

Crossrefs

Cf. A000170, A189851, A189855.

Sequence in context: A275206 A095110 A364819 * A189568 A002742 A048120

Adjacent sequences: A189855 A189856 A189857 * A189859 A189860 A189861

Keyword

nonn,hard,changed

Author

Vaclav Kotesovec, Apr 29 2011

Status

approved