This site is supported by donations to The OEIS Foundation.

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A189563 Number of permutations p of 1,2,...,n satisfying |p(i+1)-p(i)|<>4 and |p(j+4)-p(j)|<>1 for all i=1..n-1, j=1..n-4. 8
 1, 1, 2, 6, 24, 48, 182, 868, 5752, 37156, 296944, 2738820, 28894206, 335399468, 4285522402, 59536763892, 892785282788 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(n) is also the number of ways to place n nonattacking pieces rook + leaper[1,4] on an n X n chessboard (in fairy chess the leaper[1,4] is called a giraffe). LINKS V. Kotesovec, Number of ways of placing non-attacking queens, kings, bishops and knights (in English and Czech) FORMULA Asymptotic: a(n)/n! ~ 1/e^4. CROSSREFS Cf. A137774, A189358. Sequence in context: A113904 A099144 A189851 * A104114 A175624 A289161 Adjacent sequences:  A189560 A189561 A189562 * A189564 A189565 A189566 KEYWORD nonn,more,hard AUTHOR Vaclav Kotesovec, Apr 23 2011 STATUS approved

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