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.

Previous Showing 21-22 of 22 results.

A185056 Number of ways to place n nonattacking composite pieces bishop + semi-rook on an n X n board.

Original entry on oeis.org

1, 2, 5, 24, 125, 796, 5635, 48042, 453947, 4834872, 56433455, 727449366, 10099103269, 152097526360, 2449915208271, 42295879864692
Offset: 1

Views

Author

Vaclav Kotesovec, Dec 22 2011

Keywords

Comments

Two semi-rooks do not attack each other if they are in the same column.

Links

Crossrefs

Cf. A088789, A187235, A002465, A099152, A000170.

A189848 Number of ways to place n nonattacking composite pieces rook + semi-rider[6,6] on an n X n chessboard.

Original entry on oeis.org

1, 2, 6, 24, 120, 720, 4920, 37488, 319644, 3033264, 31784280, 364902480, 4509620040, 59768680032, 847746532152
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(j+6k)-p(j)<>6k for all j>=1, k>=1, j+6k<=n
For information about semi-pieces see semi-bishop (A187235) and semi-queen (A099152).

Links

Crossrefs

Cf. A189285, A099152, A189843, A189844, A189846, A189847, A189842, A187235
Previous Showing 21-22 of 22 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.