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 A274948 #20 Jan 07 2023 18:09:52 %S A274948 1,0,4,0,0,0,0,9,2,1,0,0,0,0,0,0,0,16,6,3,2,1,1,1,0,0,0,0,0,0,0,0,0,0, %T A274948 25,12,7,5,4,3,2,2,1,1,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0 %N A274948 Irregular triangle read by rows: T(n,k) (n>=1, 0 <= k <= n^2) = maximal number of squares not attacked by any arrangement of k queens on an n X n board = n^2 - A274947(n,k). %C A274948 For further information see A274947, which is the main entry for this problem. %e A274948 The triangle begins: %e A274948 1, 0, %e A274948 4, 0, 0, 0, 0, %e A274948 9, 2, 1, 0, 0, 0, 0, 0, 0, 0, %e A274948 16, 6, 3, 2, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, %e A274948 25, 12, 7, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, %e A274948 36, 20, 13, 9, 8, 6, 5, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, %e A274948 ... %Y A274948 Cf. A247947, A250000. %K A274948 nonn,tabf %O A274948 1,3 %A A274948 _N. J. A. Sloane_, Jul 27 2016 %E A274948 Corrections and more terms from _Andrey Zabolotskiy_, Jul 29 2016