Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Sep 12 2015 11:00:25
%S 1,0,0,2,10,0,0,0,0,16,60,40,304,620,2512,8734,28410,94312,345824,
%T 1391072,5759566,25227796,121663032,635977968
%N Number of ways to place n nonattacking composite pieces queen + rider[2,3] on an n X n chessboard.
%C (in fairy chess the rider [2,3] is called a Zebrarider)
%C a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+2k)-p(i)|<>3k AND |p(j+3k)-p(j)|<>2k AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+2k<=n, j+3k<=n, m+k<=n
%H V. Kotesovec, <a href="https://oeis.org/wiki/User:Vaclav_Kotesovec">Number of ways of placing non-attacking queens, kings, bishops and knights</a> (in English and Czech)
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Fairy_chess_piece">Fairy chess piece</a>
%Y Cf. A102388, A189873, A189854
%K nonn,hard
%O 1,4
%A _Vaclav Kotesovec_, Apr 29 2011