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.

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

This page as a plain text file.
%I A245011 #11 Sep 12 2015 11:00:29
%S A245011 1,4,6,86,854,9556,146168,2660326,56083228,1349544632,36786865968,
%T A245011 1117327217782
%N A245011 Number of ways to place n nonattacking princesses on an n X n board.
%C A245011 A princess moves like a bishop and a knight.
%H A245011 V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Non-attacking chess pieces</a>, 6ed, 2013, p. 744.
%H A245011 Wikipedia, <a href="http://en.wikipedia.org/wiki/Fairy_chess_piece">Fairy chess piece</a>
%Y A245011 Cf. A201513, A000170, A002465, A201540.
%Y A245011 Cf. A185085, A051223, A244284, A201511, A201861, A137774.
%Y A245011 Cf. A225555.
%K A245011 nonn,hard,more
%O A245011 1,2
%A A245011 _Vaclav Kotesovec_, Sep 16 2014