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.

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

Original entry on oeis.org

1, 0, 0, 2, 10, 4, 28, 20, 56, 72, 288, 1304, 6368, 22884, 125864, 755412, 4565572, 29862256, 207238124, 1540506028, 11774180220
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+2)-p(i)|<>5 AND |p(j+5)-p(j)|<>2 AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+2<=n, j+5<=n, m+k<=n

Crossrefs

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

Crossrefs

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

Original entry on oeis.org

1, 0, 0, 2, 10, 4, 12, 32, 96, 144, 576, 2280, 11988, 47128, 232756, 1290772, 7383588, 46039788, 311958088, 2263575696, 16975534432
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+4)-p(i)|<>5 AND |p(j+5)-p(j)|<>4 AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+4<=n, j+5<=n, m+k<=n

Crossrefs

Showing 1-3 of 3 results.