login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A195897 Number of ways to place a queen, a rook, a bishop, a knight and a king on an n X n chessboard such that each piece attacks the same number of unoccupied spaces. 1

%I #19 Jun 13 2021 08:09:35

%S 28,39,90,63,64,197,15,7,5,1

%N Number of ways to place a queen, a rook, a bishop, a knight and a king on an n X n chessboard such that each piece attacks the same number of unoccupied spaces.

%H Erich Friedman, <a href="https://erich-friedman.github.io/mathmagic/0711.html">Problem of the month July 2011</a>

%e There are 64 ways to place 5 different chess pieces on an 8 X 8 chessboard with the above condition.

%e An example for a 4 X 4 board is

%e ...Q

%e ..NK

%e B...

%e R...

%K fini,full,nonn

%O 4,1

%A _Kausthub Gudipati_, Sep 25 2011

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 22 14:47 EST 2024. Contains 370256 sequences. (Running on oeis4.)