A179065 Number of non-attacking placements of 10 rooks on an n X n board.

0, 0, 0, 0, 0, 0, 0, 0, 0, 3628800, 439084800, 15807052800, 296821324800, 3636061228800, 32724551059200, 232707918643200, 1372501805875200, 6948290392243200, 30967071995059200, 123868287980236800

Offset: 1

Author

Thomas Zaslavsky, Jun 28 2010

Keywords

• easy
• nonn

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
• Index entries for linear recurrences with constant coefficients, signature (21, -210, 1330, -5985, 20349, -54264, 116280, -203490, 293930, -352716, 352716, -293930, 203490, -116280, 54264, -20349, 5985, -1330, 210, -21, 1).

Crossrefs

Column k=10 of A144084.

Cf. A179064 (9 rooks).

Programs

PARI

a(n) = 10! * binomial(n, 10)^2 \\ Andrew Howroyd, Feb 13 2018

Formula

a(n) = 10! * binomial(n, 10)^2.