This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A182563 Number of ways to place n non-attacking semi-knights on an n x n chessboard 1
 1, 6, 70, 1289, 33864, 1148760, 47700972, 2344465830, 133055587660, 8559364525414, 615266768106190, 48861588247978827, 4247584874013608724, 401107335066453376830, 40880928693752664368224 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Semi-knight is a semi-leaper [1,2]. Moves of a semi-knight are allowed only in [2,1] and [-2,-1]. See also semi-bishops (A187235). LINKS V. Kotesovec, Non-attacking chess pieces, 6ed, p.289 FORMULA Asymptotic: a(n) ~ n^(2n)/n!*exp(-3/2). CROSSREFS Cf. A182562, A201540, A201513, A002465, A201511, A197989, A201861. Sequence in context: A001448 A024489 A036361 * A211036 A284215 A050788 Adjacent sequences:  A182560 A182561 A182562 * A182564 A182565 A182566 KEYWORD nonn,hard,more AUTHOR Vaclav Kotesovec, May 05 2012 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.

Last modified October 20 07:17 EDT 2018. Contains 316378 sequences. (Running on oeis4.)