login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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
1, 4, 6, 86, 854, 9556, 146168, 2660326, 56083228, 1349544632, 36786865968, 1117327217782 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

A princess moves like a bishop and a knight.

LINKS

Table of n, a(n) for n=1..12.

V. Kotesovec, Non-attacking chess pieces, 6ed, 2013, p. 744.

Wikipedia, Fairy chess piece

CROSSREFS

Cf. A201513, A000170, A002465, A201540.

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

Cf. A225555.

Sequence in context: A213335 A101138 A222483 * A012897 A013079 A222495

Adjacent sequences:  A245008 A245009 A245010 * A245012 A245013 A245014

KEYWORD

nonn,hard,more

AUTHOR

Vaclav Kotesovec, Sep 16 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 25 23:39 EDT 2021. Contains 346294 sequences. (Running on oeis4.)