login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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, 4472281486633326131737868 (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
Sequence in context: A354328 A036361 A365057 * A211036 A284215 A050788
KEYWORD
nonn,hard,more
AUTHOR
Vaclav Kotesovec, May 05 2012
EXTENSIONS
a(16) from Vaclav Kotesovec, May 24 2021
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 04:56 EDT 2024. Contains 371767 sequences. (Running on oeis4.)