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.

Showing 1-1 of 1 results.

A189871 Number of ways to place n nonattacking composite pieces queen + leaper[3,5] on an n X n chessboard.

Original entry on oeis.org

1, 0, 0, 2, 10, 0, 8, 24, 72, 116, 384, 1660, 7344, 24364, 130408, 743360, 4242704, 27018788, 190618152, 1431986780, 11053915716
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+3)-p(i)|<>5 AND |p(j+5)-p(j)|<>3 AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+3<=n, j+5<=n, m+k<=n

Links

Crossrefs

Cf. A051223, A189866, A189869, A189569, A189870
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.