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-3 of 3 results.

A189865 Number of ways to place n nonattacking composite pieces queen + leaper[1,4] on an n X n chessboard.

Original entry on oeis.org

1, 0, 0, 2, 10, 0, 0, 4, 32, 76, 196, 632, 3368, 12532, 79788, 468286, 2815088, 18287968, 126620984, 938037664, 7232141830, 59774887344
Offset: 1

Views

Author

Vaclav Kotesovec, Apr 29 2011

Keywords

Comments

In fairy chess the leaper [1,4] is called a giraffe.
a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+1)-p(i)|<>4 AND |p(j+4)-p(j)|<>1 AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+1<=n, j+4<=n, m+k<=n

Crossrefs

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

Original entry on oeis.org

1, 0, 0, 2, 10, 0, 0, 0, 40, 52, 160, 500, 2656, 11540, 67776, 415716, 2610520, 17450592, 124903880, 944965832, 7292031780
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+1)-p(i)|<>5 AND |p(j+5)-p(j)|<>1 AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+1<=n, j+5<=n, m+k<=n

Crossrefs

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

Original entry on oeis.org

1, 0, 0, 2, 10, 0, 0, 0, 0, 48, 152, 472, 2696, 12320, 74436, 429620, 2515116, 16122496, 113016608, 843492920, 6575649316, 54694203188
Offset: 1

Views

Author

Vaclav Kotesovec, Apr 29 2011

Keywords

Comments

In fairy chess the leaper [2,3] is called a zebra.
a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+2)-p(i)|<>3 AND |p(j+3)-p(j)|<>2 AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+2<=n, j+3<=n, m+k<=n

Crossrefs

Showing 1-3 of 3 results.