This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A179065 Number of non-attacking placements of 10 rooks on an n X n board. 3
 0, 0, 0, 0, 0, 0, 0, 0, 0, 3628800, 439084800, 15807052800, 296821324800, 3636061228800, 32724551059200, 232707918643200, 1372501805875200, 6948290392243200, 30967071995059200, 123868287980236800 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,10 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..200 Christopher R. H. Hanusa, T Zaslavsky, S Chaiken, A q-Queens Problem. IV. Queens, Bishops, Nightriders (and Rooks), arXiv preprint arXiv:1609.00853, a12016 FORMULA a(n) = 10! * binomial(n, 10)^2. PROG (PARI) a(n) = 10! * binomial(n, 10)^2 \\ Andrew Howroyd, Feb 13 2018 CROSSREFS Column k=10 of A144084. Cf. A179064 (9 rooks). Sequence in context: A153761 A133132 A228913 * A213872 A227672 A172540 Adjacent sequences:  A179062 A179063 A179064 * A179066 A179067 A179068 KEYWORD easy,nonn AUTHOR Thomas Zaslavsky, Jun 28 2010 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 October 22 22:34 EDT 2019. Contains 328335 sequences. (Running on oeis4.)