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!)
A245011 Number of ways to place n nonattacking princesses on an n X n board. 1

%I #11 Sep 12 2015 11:00:29

%S 1,4,6,86,854,9556,146168,2660326,56083228,1349544632,36786865968,

%T 1117327217782

%N Number of ways to place n nonattacking princesses on an n X n board.

%C A princess moves like a bishop and a knight.

%H V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 6ed, 2013, p. 744.

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Fairy_chess_piece">Fairy chess piece</a>

%Y Cf. A201513, A000170, A002465, A201540.

%Y Cf. A185085, A051223, A244284, A201511, A201861, A137774.

%Y Cf. A225555.

%K nonn,hard,more

%O 1,2

%A _Vaclav Kotesovec_, Sep 16 2014

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 April 16 16:52 EDT 2024. Contains 371749 sequences. (Running on oeis4.)