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!)
A179063 Number of non-attacking placements of 8 rooks on an n X n board. 4
0, 0, 0, 0, 0, 0, 0, 40320, 3265920, 81648000, 1097712000, 9879408000, 66784798080, 363606122880, 1669619952000, 6678479808000, 23828156352000, 77203226580480, 230333593351680, 639815537088000, 1669577821632000, 4122835028928000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,8
LINKS
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 (17, -136, 680, -2380, 6188, -12376, 19448, -24310, 24310, -19448, 12376, -6188, 2380, -680, 136, -17, 1).
FORMULA
a(n) = 8!*binomial(n,8)^2.
G.f.: -40320*x^8*(x^8 +64*x^7 +784*x^6 +3136*x^5 +4900*x^4 +3136*x^3 +784*x^2 +64*x +1) / (x -1)^17. - Colin Barker, Jan 08 2013
PROG
(PARI) a(n) = 8!*binomial(n, 8)^2 \\ Andrew Howroyd, Feb 13 2018
CROSSREFS
Column k=8 of A144084.
Cf. A179062 (7 rooks), A179064 (9 rooks).
Sequence in context: A254081 A228911 A213878 * A246196 A246616 A291115
KEYWORD
easy,nonn
AUTHOR
Thomas Zaslavsky, Jun 27 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)