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 A248744 #71 Feb 16 2025 08:33:23
%S A248744 1,1,6,48,488,6130,92592,1642046,33514112,774478098,19996371200,
%T A248744 570583424422,17831721894912,605743986163706,22223926472824832,
%U A248744 875786473087350750,36893467224629215232,1654480168085245432354,78692809748219369422848,3956839189675526769415958
%N A248744 Number of different ways one can attack all squares on an n X n chessboard with n rooks.
%C A248744 Number of minimum (and minimal) dominating sets in the n X n rook graph. - _Eric W. Weisstein_, Jun 20 2017 and Aug 02 2017
%D A248744 A. M. Yaglom and I. M. Yaglom, Challenging Mathematical Problems with Elementary Solutions, Vol. 1: Combinatorial Analysis and Probability Theory, Dover Publications, 1987, p. 77
%H A248744 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimalDominatingSet.html">Minimal Dominating Set</a>
%H A248744 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/MinimumDominatingSet.html">Minimum Dominating Set</a>
%H A248744 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/RookGraph.html">Rook Graph</a>
%F A248744 a(n) = 2*n^n - n!.
%p A248744 A248744:=n->2*n^n-n!: seq(A248744(n), n=0..25); # _Wesley Ivan Hurt_, Nov 30 2017
%t A248744 Table[2 n^n - n!, {n, 20}]
%Y A248744 Main diagonal of A290632 and of A368831.
%Y A248744 Cf. A000142, A000312.
%K A248744 nonn
%O A248744 0,3
%A A248744 _Stephen Penrice_, Apr 09 2017