%I #15 Aug 01 2022 08:08:55
%S 1,2,2,8,12,22,58,276,648,2304,6508,24528,96402,466922,2271738,
%T 13723826,76579326,512425626,3281233020,24654941268,175398054696
%N Number of ways to place n nonattacking composite pieces rook + rider[1,2] on an n X n chessboard.
%C (In fairy chess the rider [1,2] is called a Nightrider, Rook + Nightrider = Waran.)
%C a(n) is also the number of permutations p of 1,2,...,n satisfying |p(i+k) - p(i)| <> 2k AND |p(j+2k) - p(j)| <> k for all i >= 1, j >= 1, k >= 1, i+k <= n, j+2k <= 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, A000170.
%K nonn,hard
%O 1,2
%A _Vaclav Kotesovec_, Apr 29 2011