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.

A189569 Number of permutations p of 1,2,...,n satisfying |p(i+3)-p(i)|<>5 and |p(j+5)-p(j)|<>3 for all i=1..n-3, j=1..n-5.

Original entry on oeis.org

1, 1, 2, 6, 24, 120, 464, 2274, 13236, 91760, 740562, 6541984, 65632694, 732880076, 8995905626, 120367234946
Offset: 0

Views

Author

Vaclav Kotesovec, Apr 23 2011

Keywords

Comments

a(n) is also the number of ways to place n nonattacking pieces rook + leaper[3,5] on an n X n chessboard.

Crossrefs

Formula

Asymptotic: a(n)/n! ~ 1/e^4.