The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A201511 Number of ways to place n nonattacking wazirs on an n X n board. 11
 1, 2, 22, 405, 10741, 368868, 15516804, 771464278, 44218721793, 2868879752822, 207739939478618, 16602826428818482, 1451305771147909684, 137715836041691050398, 14096224186664736126206, 1547966111897855935957132, 181519663430661533452513680, 22636566614411901986006002896 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Wazir is a leaper [0,1]. LINKS Vaclav Kotesovec, Table of n, a(n) for n = 1..21 (terms a(11)-a(18) computed by Peter Tittmann) V. Kotesovec, Non-attacking chess pieces, 6ed, 2013, p. 382. Peter Tittmann, Polynomials of nxn Grid Graphs [broken link] FORMULA Asymptotics (Vaclav Kotesovec, Nov 29 2011): a(n) ~ n^(2n)/n!*exp(-5/2). CROSSREFS Cf. A172225, A172226, A172227, A172228, A178409, A201507, A201508, A201510. Cf. A006506. Sequence in context: A138463 A007842 A287595 * A264839 A241347 A163436 Adjacent sequences:  A201508 A201509 A201510 * A201512 A201513 A201514 KEYWORD nonn,nice,hard AUTHOR Vaclav Kotesovec, Dec 02 2011 EXTENSIONS a(19)-a(20) from Vaclav Kotesovec, Aug 30 2016 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 27 15:49 EDT 2021. Contains 346308 sequences. (Running on oeis4.)