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 A179065 #10 Jun 29 2023 09:45:42 %S A179065 0,0,0,0,0,0,0,0,0,3628800,439084800,15807052800,296821324800, %T A179065 3636061228800,32724551059200,232707918643200,1372501805875200, %U A179065 6948290392243200,30967071995059200,123868287980236800 %N A179065 Number of non-attacking placements of 10 rooks on an n X n board. %H A179065 Andrew Howroyd, <a href="/A179065/b179065.txt">Table of n, a(n) for n = 1..200</a> %H A179065 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 A179065 <a href="/index/Rec#order_21">Index entries for linear recurrences with constant coefficients</a>, signature (21, -210, 1330, -5985, 20349, -54264, 116280, -203490, 293930, -352716, 352716, -293930, 203490, -116280, 54264, -20349, 5985, -1330, 210, -21, 1). %F A179065 a(n) = 10! * binomial(n, 10)^2. %o A179065 (PARI) a(n) = 10! * binomial(n, 10)^2 \\ _Andrew Howroyd_, Feb 13 2018 %Y A179065 Column k=10 of A144084. %Y A179065 Cf. A179064 (9 rooks). %K A179065 easy,nonn %O A179065 1,10 %A A179065 _Thomas Zaslavsky_, Jun 28 2010