OFFSET
1,10
COMMENTS
In fairy chess, the rider [1,3] is called a Camelrider.
a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+k)-p(i)|<>3k AND |p(j+3k)-p(j)|<>k AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+k<=n, j+3k<=n, m+k<=n
LINKS
V. Kotesovec, Number of ways of placing non-attacking queens, kings, bishops and knights (in English and Czech)
Wikipedia, Fairy chess piece
CROSSREFS
KEYWORD
nonn,hard
AUTHOR
Vaclav Kotesovec, Apr 29 2011
STATUS
approved