This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A189867 Number of ways to place n nonattacking composite pieces queen + leaper[2,3] on an n X n chessboard. 2
 1, 0, 0, 2, 10, 0, 0, 0, 0, 48, 152, 472, 2696, 12320, 74436, 429620, 2515116, 16122496, 113016608, 843492920, 6575649316, 54694203188 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 COMMENTS In fairy chess the leaper [2,3] is called a zebra. a(n) is also number of permutations p of 1,2,...,n satisfying |p(i+2)-p(i)|<>3 AND |p(j+3)-p(j)|<>2 AND |p(m+k)-p(m)|<>k for all i>=1, j>=1, m>=1, k>=1, i+2<=n, j+3<=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 Cf. A051223, A189864, A189565 Sequence in context: A050924 A181500 A189876 * A189875 A189866 A189874 Adjacent sequences:  A189864 A189865 A189866 * A189868 A189869 A189870 KEYWORD nonn,hard AUTHOR Vaclav Kotesovec, Apr 29 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .