This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A179064 #14 Jun 29 2023 09:44:39 %S A179064 0,0,0,0,0,0,0,0,362880,36288000,1097712000,17563392000,185513328000, %T A179064 1454424491520,9090153072000,47491411968000,214453407168000, %U A179064 857813628672000,3096707199505920,10237048593408000,31350961317312000 %N A179064 Number of non-attacking placements of 9 rooks on an n X n board. %H A179064 Andrew Howroyd, <a href="/A179064/b179064.txt">Table of n, a(n) for n = 1..200</a> %H A179064 Christopher R. H. Hanusa, T Zaslavsky, S Chaiken, <a href="http://arxiv.org/abs/1609.00853">A q-Queens Problem. IV. Queens, Bishops, Nightriders (and Rooks)</a>, arXiv preprint arXiv:1609.00853, a12016 %H A179064 <a href="/index/Rec#order_19">Index entries for linear recurrences with constant coefficients</a>, signature (19, -171, 969, -3876, 11628, -27132, 50388, -75582, 92378, -92378, 75582, -50388, 27132, -11628, 3876, -969, 171, -19, 1). %F A179064 a(n) = 9!*binomial(n,9)^2. %F A179064 G.f.: -362880*x^9*(x +1)*(x^8 +80*x^7 +1216*x^6 +5840*x^5 +10036*x^4 +5840*x^3 +1216*x^2 +80*x +1) / (x -1)^19. - _Colin Barker_, Jan 08 2013 %o A179064 (PARI) a(n) = 9! * binomial(n, 9)^2 \\ _Andrew Howroyd_, Feb 13 2018 %Y A179064 Column k=9 of A144084. %Y A179064 Cf. A179063 (8 rooks), A179065 (10 rooks). %K A179064 easy,nonn %O A179064 1,9 %A A179064 _Thomas Zaslavsky_, Jun 28 2010