A193580 -id:A193580 - cp's OEIS frontend

A063443 Number of ways to tile an n X n square with 1 X 1 and 2 X 2 tiles.

1, 1, 2, 5, 35, 314, 6427, 202841, 12727570, 1355115601, 269718819131, 94707789944544, 60711713670028729, 69645620389200894313, 144633664064386054815370, 540156683236043677756331721, 3641548665525780178990584908643, 44222017282082621251230960522832336

Offset: 0

Reiner Martin, Jul 23 2001

a(n) is also the number of ways to populate an n-1 X n-1 chessboard with nonattacking kings (including the case of zero kings). Cf. A193580. - Andrew Woods, Aug 27 2011

Also the number of vertex covers and independent vertex sets of the n-1 X n-1 king graph.

Steven R. Finch, Mathematical Constants, Cambridge, 2003, p. 343

Andrew Woods and Vaclav Kotesovec and Johan Nilsson, Table of n, a(n) for n = 0..40 (terms 0..21 from Andrew Woods, terms 22..24 from Vaclav Kotesovec and terms 25..40 from Johan Nilsson)
Vaclav Kotesovec, Non-attacking chess pieces, 6ed, 2013, p. 68-69.
R. J. Mathar, Tiling n x m rectangles with 1 x 1 and s x s squares, arXiv:1609.03964 [math.CO], 2016, Section 4.1.
J. Nilsson, On Counting the Number of Tilings of a Rectangle with Squares of Size 1 and 2, Journal of Integer Sequences, Vol. 20 (2017), Article 17.2.2.
Eric Weisstein's World of Mathematics, Independent Vertex Set
Eric Weisstein's World of Mathematics, King Graph
Eric Weisstein's World of Mathematics, Vertex Cover

Cf. A001045, A006506, A054854, A054855, A063650-A063653, A067966, etc.
Cf. A045846, A211348, A247413, A201513.
Cf. A212269, A067958.
a(n) = row sum n-1 of A193580.
Main diagonal of A245013.

Needs["LinearAlgebra`MatrixManipulation`"] Remove[mat] step[sa[rules1_, {dim1_, dim1_}], sa[rules2_, {dim2_, dim2_}]] := sa[Join[rules2, rules1 /. {x_Integer, y_Integer} -> {x + dim2, y}, rules1 /. {x_Integer, y_Integer} -> {x, y + dim2}], {dim1 + dim2, dim1 + dim2}] mat[0] = sa[{{1, 1} -> 1}, {1, 1}]; mat[1] = sa[{{1, 1} -> 1, {1, 2} -> 1, {2, 1} -> 1}, {2, 2}]; mat[n_] := mat[n] = step[mat[n - 2], mat[n - 1]]; A[n_] := mat[n] /. sa -> SparseArray; F[n_] := MatrixPower[A[n], n + 1][[1, 1]]; (* Mark McClure (mcmcclur(AT)bulldog.unca.edu), Mar 19 2006 *)
$RecursionLimit = 1000; Clear[a, b]; b[n_, l_List] := b[n, l] = Module[{m=Min[l], k}, If[m>0, b[n-m, l-m], If[n == 0, 1, k=Position[l, 0, 1, 1][[1, 1]]; b[n, ReplacePart[l, k -> 1]] + If[n>1 && k 2, k+1 -> 2}]], 0]]]]; a[n_] := a[n] = If[n<2, 1, b[n, Table[0, {n}]]]; Table[Print[a[n]]; a[n], {n, 0, 17}] (* Jean-François Alcover, Dec 11 2014, after Alois P. Heinz *)

Lim_{n -> infinity} (a(n))^(1/n^2) = A247413 = 1.342643951124... . - Brendan McKay, 1996

4 more terms from R. H. Hardin, Jan 23 2002
2 more terms from Keith Schneider (kschneid(AT)bulldog.unca.edu), Mar 19 2006
5 more terms from Andrew Woods, Aug 27 2011
a(22)-a(24) in b-file from Vaclav Kotesovec, May 01 2012
a(0) inserted by Alois P. Heinz, Sep 17 2014
a(25)-a(40) in b-file from Johan Nilsson, Mar 10 2016

A236679 Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X n square under all symmetry operations of the square; irregular triangle T(n,k), n>=2, 0<=k<=floor(n/2)^2, read by rows.

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 4, 2, 1, 1, 3, 13, 20, 14, 1, 6, 37, 138, 277, 273, 143, 39, 7, 1, 1, 6, 75, 505, 2154, 5335, 7855, 6472, 2756, 459, 1, 10, 147, 1547, 10855, 50021, 153311, 311552, 416825, 361426, 200996, 71654, 16419, 2363, 211, 11, 1, 1, 10, 246, 3759, 39926, 291171

Offset: 2

Christopher Hunt Gribble, Jan 29 2014

Changing the offset from 2 to 1, this is also the sequence: "Triangle read by rows: T(n,k) is the number of nonequivalent ways to place k non-attacking kings on an n X n board." (For if each king is represented by a 2 X 2 tile with the king in the upper left corner, the kings do not attack each other.) For example, with offset 1, T(4,3) = 20 because there are 20 nonequivalent ways to place 3 kings on a 4 X 4 chessboard so that no king threatens any other. - Heinrich Ludwig and N. J. A. Sloane, Dec 21 2016

It appears that rows 2n and 2n-1 both contain n^2 + 1 entries. Rotations and reflections of placements are not counted. If they are to be counted, see A193580. - Heinrich Ludwig, Dec 11 2016

			T(4,2) = 4 because the number of equivalence classes of ways of placing 2 2 X 2 square tiles in a 4 X 4 square under all symmetry operations of the square is 4. The portrayal of an example from each equivalence class is:
._______        _______        _______        _______
| . | . |      | . |___|      | . |   |      |_______|
|___|___|      |___| . |      |___|___|      | . | . |
|       |      |   |___|      |   | . |      |___|___|
|_______|      |_______|      |___|___|      |_______|
The first 6 rows of T(n,k) are:
.\ k  0    1    2    3    4    5    6    7    8    9
n
2     1    1
3     1    1
4     1    3    4    2    1
5     1    3   13   20   14
6     1    6   37  138  277  273  143   39    7    1
7     1    6   75  505 2154 5335 7855 6472 2756  459

Heinrich Ludwig, Table of n, a(n) for n = 2..107
Christopher Hunt Gribble, C++ program

Cf. A054252, A236560, A236757, A236800, A236829, A236865, A236915, A236936, A236939.
Row sums give A275869.
Columns 2..7: A279111, A279112, A279113, A279114, A279115, A279116.
Diagonal T(n,n) is A279117.
Cf. A193580.

It appears that:
T(n,0) = 1, n>= 2
T(n,1) = (floor((n-2)/2)+1)*(floor((n-2)/2+2))/2, n >= 2
T(c+2*2,2) = A131474(c+1)*(2-1) + A000217(c+1)*floor(2^2/4) + A014409(c+2), 0 <= c < 2, c even
T(c+2*2,2) = A131474(c+1)*(2-1) + A000217(c+1)*floor((2-1)(2-3)/4) + A014409(c+2), 0 <= c < 2, c odd
T(c+2*2,3) = (c+1)(c+2)/2(2*A002623(c-1)*floor((2-c-1)/2) + A131941(c+1)*floor((2-c)/2)) + S(c+1,3c+2,3), 0 <= c < 2 where
S(c+1,3c+2,3) =
A054252(2,3),  c = 0
A236679(5,3),  c = 1

More terms from Heinrich Ludwig, Dec 11 2016 (The former entry A279118 from Heinrich Ludwig was merged into this entry by N. J. A. Sloane, Dec 21 2016)

A061996 Number of ways to place 3 nonattacking kings on an n X n board.

Original entry on oeis.org

0, 0, 0, 8, 140, 964, 3920, 11860, 29708, 65240, 129984, 240240, 418220, 693308, 1103440, 1696604, 2532460, 3684080, 5239808, 7305240, 10005324, 13486580, 17919440, 23500708, 30456140, 39043144, 49553600, 62316800

Offset: 0

Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), May 31 2001

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Vaclav Kotesovec, Placing non-attacking queens and kings on boards of various sizes, part of "Between chessboard and computer", 1996, pp. 204 - 206.
Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1).

Cf. A061995, A061997, A061998, A193580.

CoefficientList[Series[4x^3(2 +21x +38x^2 -42x^3 +11x^4)/(1-x)^7, {x, 0, 40}], x] (* Vincenzo Librandi, May 02 2013 *)

[(n-1)*(n-2)*(n^4+3*n^3-20*n^2-30*n+132)/6 -44*bool(n==0) for n in (0..40)] # G. C. Greubel, Apr 29 2022

G.f.: 4*x^3*(2 + 21*x + 38*x^2 - 42*x^3 + 11*x^4)/(1 - x)^7.
Recurrence: a(n) = 7*a(n-1) - 21*a(n-2) + 35*a(n-3) - 35*a(n-4) + 21*a(n-5) - 7*a(n-6) + a(n-7), n >= 8.
a(n) = (n-1)*(n-2)*(n^4 + 3*n^3 - 20*n^2 - 30*n + 132)/6, n >= 1.
a(n) = A193580(n,3). - R. J. Mathar, Sep 03 2016
E.g.f.: -44 + (1/6)*(264 -264*x +132*x^2 -36*x^3 +38*x^4 +15*x^5 +x^6)*exp(x). - G. C. Greubel, Apr 29 2022

A061997 Number of ways to place 4 nonattacking kings on an n X n board.

Original entry on oeis.org

0, 0, 0, 1, 79, 1987, 16834, 85275, 317471, 962089, 2515262, 5882109, 12605095, 25175191, 47443474, 85152487, 146608359, 243516365, 392004286, 613859609, 938008287, 1402264459, 2055382210, 2959442131, 4192607119

Offset: 0

Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), May 31 2001

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Vaclav Kotesovec, Number of ways of placing non-attacking queens and kings on boards of various sizes, part of V. Kotesovec, Between chessboard and computer, 1996, pp. 204 - 206.
Index entries for linear recurrences with constant coefficients, signature (9,-36,84,-126,126,-84,36,-9,1).

Cf. A061995, A061996, A061998, A193580.

R:=PowerSeriesRing(Integers(), 50);
[0,0,0] cat Coefficients(R!( x^3*(1 +70*x +1312*x^2 +1711*x^3 -1209*x^4 -1060*x^5 +1186*x^6 -361*x^7 +30*x^8)/(1-x)^9 )); // G. C. Greubel, Apr 30 2022

CoefficientList[Series[x^3*(1 +70*x +1312*x^2 +1711*x^3 -1209*x^4 -1060*x^5 +1186*x^6 -361*x^7 +30*x^8)/(1-x)^9, {x, 0, 50}], x] (* Vincenzo Librandi, May 02 2013 *)

[0,0,0]+[(n^8 -54*n^6 +72*n^5 +995*n^4 -2472*n^3 -5094*n^2 +21480*n -17112)/24 for n in (3..50)] # G. C. Greubel, Apr 30 2022

G.f.: x^3*(1 + 70*x + 1312*x^2 + 1711*x^3 - 1209*x^4 - 1060*x^5 + 1186*x^6 - 361*x^7 + 30*x^8)/(1 - x)^9.
Recurrence: a(n) = 9*a(n-1) - 36*a(n-2) + 84*a(n-3) - 126*a(n-4) + 126*a(n-5) - 84*a(n-6) + 36*a(n-7) - 9*a(n-8) + a(n-9), n >= 12.
Explicit formula (K.Fabel and K.Soltsien): a(n) = (n^8 - 54*n^6 + 72*n^5 + 995*n^4 - 2472*n^3 - 5094*n^2 + 21480*n - 17112)/24, n >= 3.
a(n) = A193580(n,4). - R. J. Mathar, Sep 03 2016

A061998 Number of ways to place 5 nonattacking kings on an n X n board.

Original entry on oeis.org

0, 0, 0, 0, 0, 1974, 42368, 397014, 2326320, 10087628, 35464464, 106783320, 285336128, 693331146, 1558986816, 3286192514, 6558317232, 12488282352, 22829958032, 40269324564, 68817690624, 114333609854, 185205015936

Offset: 0

Antonio G. Astudillo (afg_astudillo(AT)hotmail.com), May 31 2001

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Vaclav Kotesovec, Number of ways of placing non-attacking queens and kings on boards of various sizes, part of V. Kotesovec, Between chessboard and computer, 1996, pp. 204 - 206.
Index entries for linear recurrences with constant coefficients, signature (11,-55,165,-330,462,-462,330,-165,55,-11,1).

Cf. A061995, A061996, A061997, A193580.

CoefficientList[Series[2*x^5*(987 +10327*x +19768*x^2 -18152*x^3 -2711*x^4 +5149*x^5 +1774*x^6 -2882*x^7 +958*x^8 -98*x^9)/(1-x)^11, {x,0,45}], x] (* Vincenzo Librandi, May 02 2013 *)

[0,0,0,0]+[(n-4)*(n^9 +4*n^8 -74*n^7 -176*n^6 +2411*n^5 +1844*n^4 -38194*n^3 +18944*n^2 +236520*n -316320)/120 for n in (4..50)] # G. C. Greubel, May 01 2022

G.f.: 2*x^5*(987 + 10327*x + 19768*x^2 - 18152*x^3 - 2711*x^4 + 5149*x^5 + 1774*x^6 - 2882*x^7 + 958*x^8 - 98*x^9)/(1 - x)^11.
Recurrence: a(n) = 11*a(n-1) - 55*a(n-2) + 165*a(n-3) - 330*a(n-4) + 462*a(n-5) - 462*a(n-6) + 330*a(n-7) - 165*a(n-8) + 55*a(n-9) - 11*a(n-10) + a(n-11), n >= 15.
Explicit formula (V.Kotesovec, 1992): a(n) = (n - 4)*(n^9 + 4*n^8 - 74*n^7 - 176*n^6 + 2411*n^5 + 1844*n^4 - 38194*n^3 + 18944*n^2 + 236520*n - 316320)/120, n >= 4.
a(n) = A193580(n,5). - R. J. Mathar, Sep 03 2016

A201513 Number of ways to place n nonattacking kings on an n X n board.

Original entry on oeis.org

1, 1, 0, 8, 79, 1974, 62266, 2484382, 119138166, 6655170642, 423677826986, 30242576462856, 2390359529372724, 207127434998494421, 19516867860507198208, 1986288643031862123264, 217094567491104327256049, 25357029929230564723578520, 3151672341378566296926684684

Offset: 0

Vaclav Kotesovec, Dec 02 2011

Alois P. Heinz, Table of n, a(n) for n = 0..21 (terms n=1..20 from Andrew Woods)
V. Kotesovec, Non-attacking chess pieces, 6ed, 2013, p. 77.

Cf. A061995, A061996, A061997, A061998, A172158, A194788, A201369.
Cf. A063443.
Main diagonal of A098487, A193580.

Asymptotics (Vaclav Kotesovec, Nov 29 2011): n^(2n)/n!*exp(-9/2).

a(0)=1 prepended by Alois P. Heinz, May 11 2017

A286436 Irregular triangle read by rows: T(n, k) = number of ways to tile an n X n X n triangular area with k 2 X 2 X 2 triangular tiles and an appropriate number (= n^2-4*k) of 1 X 1 X 1 tiles.

Original entry on oeis.org

1, 1, 1, 1, 3, 1, 7, 9, 4, 1, 1, 13, 48, 63, 25, 1, 21, 153, 494, 747, 546, 219, 57, 9, 1, 1, 31, 372, 2247, 7459, 14064, 15160, 9233, 3069, 480, 14, 1, 43, 765, 7396, 42983, 157248, 369787, 563287, 556932, 358974, 153520, 45282, 9634, 1529, 186, 16, 1, 1, 57, 1404

Offset: 1

Heinrich Ludwig, May 16 2017

The triangle T(n, k) is irregularly shaped: For n >= 4: 0 <= k <= n^2/4 if n is even, 0 <= k <= (n^2 -9)/4 if n is odd. First row corresponds to n = 1.
Rotations and reflections of tilings are counted. If they are to be ignored, see A286443. Tiles of the same size are indistinguishable.
For an analogous problem concerning square tiles, see A193580.

			The triangle begins with T(1, 0):
1;
1,  1;
1,  3;
1,  7,   9,   4,   1;
1, 13,  48,  63,  25;
1, 21, 153, 494, 747, 546, 219, 57, 9, 1;
T(4, 3) = 4 because there are 4 ways to tile an area of size 4X4X4 with 3 tiles of size 2X2X2 and fill up the rest with tiles of size 1X1X1.

Heinrich Ludwig, Table of n, a(n) for n = 1..140

Cf. A193580, A286443, A286437, A286438, A286439, A286440, A286441, A286442.

A201369 Number of ways to place 8 nonattacking kings on an n X n board.

Original entry on oeis.org

0, 0, 0, 0, 27, 21792, 3324193, 119138166, 1979541332, 20142680752, 145977165234, 824771174978, 3850985758339, 15461577137802, 54912339921707, 176153338628674, 518569625849418, 1418340918023792, 3639736652346172, 8833161922947702, 20405252721413369

Offset: 1

Vaclav Kotesovec, Nov 30 2011

nonn

V. Kotesovec, Non-attacking chess pieces

Cf. A061995, A061996, A061997, A061998, A172158, A193580, A194788.

Explicit formula (Vaclav Kotesovec, after values computed by Andrew Woods, Nov 30 2011): (n^16 - 252*n^14 + 336*n^13 + 27762*n^12 - 70896*n^11 - 1699656*n^10 + 6330240*n^9 + 60677169*n^8 - 304864560*n^7 - 1181816748*n^6 + 8314366704*n^5 + 8495481308*n^4 - 121101870624*n^3 + 74007948336*n^2 + 730891869120*n - 1180990460160)/40320, n>=7.

G.f.: -x^5*(14882*x^18 - 180784*x^17 + 1061244*x^16 - 4500406*x^15 + 15038864*x^14 - 34328850*x^13 + 40903004*x^12 - 8667835*x^11 + 23857551*x^10 - 260744627*x^9 + 545801251*x^8 - 276255996*x^7 - 467674682*x^6 + 484515328*x^5 + 391528458*x^4 + 65572237*x^3 + 2957401*x^2 + 21333*x + 27)/(x-1)^17.

A201771 Number of ways to place 9 nonattacking kings on an n X n board.

Original entry on oeis.org

0, 0, 0, 0, 1, 3600, 2882737, 229095676, 6655170642, 103395053720, 1051588999820, 7878155295948, 46838274976147, 232322652402464, 995789500001315, 3784235129731708, 12999197522073908, 40969826999523768, 119876498636101786, 328726265508168780, 851369417500529061

Offset: 1

Vaclav Kotesovec, Dec 04 2011

nonn

V. Kotesovec, Non-attacking chess pieces

Cf. A061995, A061996, A061997, A061998, A172158, A193580, A194788, A201369.

Explicit formula (Vaclav Kotesovec, after values computed by Andrew Woods, Dec 04 2011): n^18/362880 - n^16/1120 + n^15/840 + 1559*n^14/12096 - 119*n^13/360 - 7681*n^12/720 + 479*n^11/12 + 9383677*n^10/17280 - 195031*n^9/72 - 24176483*n^8/1440 + 4447749*n^7/40 + 5032857271*n^6/18144 - 495178813*n^5/180 - 2551293629*n^4/2520 + 1588223225*n^3/42 - 11469403819*n^2/315 - 664490248*n/3 + 405670140, n>=8.

G.f.: x^5*(54764*x^21 - 805588*x^20 + 6061268*x^19 - 31485512*x^18 + 117971558*x^17 - 312791986*x^16 + 620038858*x^15 - 1193322246*x^14 + 2685590901*x^13 - 4918483903*x^12 + 3824558880*x^11 + 5110355848*x^10 - 13987162841*x^9 + 5213745395*x^8 + 15789867458*x^7 - 14255103822*x^6 - 13342741937*x^5 - 2791816301*x^4 - 174938304*x^3 - 2814508*x^2 - 3581*x - 1)/(x-1)^19.

A220467 Number of ways to place 10 nonattacking kings on an n X n board.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1601292, 314949564, 17143061738, 423677826986, 6210264633994, 62831788827614, 481992723228798, 2982908737810114, 15548436178142582, 70420082692285198, 283631426534134042, 1034163399690010346, 3461457325296584554, 10754832937513676198

Offset: 1

Vaclav Kotesovec, Dec 15 2012

nonn

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
V. Kotesovec, Non-attacking chess pieces

Cf. A061995 (2 kings), A061996 (3 kings), A061997 (4 kings).
Cf. A061998 (5 kings), A172158 (6 kings), A194788 (7 kings).
Cf. A201369 (8 kings), A201771 (9 kings).
Column k=10 of A193580.

Rest[CoefficientList[Series[-2*x^7*(97581*x^22 - 1758956*x^21 + 16320562*x^20 - 100734462*x^19 + 443795293*x^18 - 1471049082*x^17 + 3971393292*x^16 - 9304893422*x^15 + 17917931016*x^14 - 22612415810*x^13 + 6949925614*x^12 + 21430418050*x^11 + 9738010368*x^10 - 153051533038*x^9 + 256884162558*x^8 - 71451647970*x^7 - 265785285277*x^6 + 220345759446*x^5 + 251887022384*x^4 + 63841610284*x^3 + 5432696107*x^2 + 140661216*x + 800646)/(x-1)^21, {x, 0, 20}], x]]

a(n) = n^20/3628800 - n^18/8960 + n^17/6720 + 353*n^16/17280 - 53*n^15/1008 - 29467*n^14/13440 + 11867*n^13/1440 + 25901053*n^12/172800 - 107495*n^11/144 - 8467959*n^10/1280 + 122792641*n^9/2880 + 32499630031*n^8/181440 - 112903333*n^7/72 - 16042907329*n^6/6720 + 36445613711*n^5/1008 - 1784819159*n^4/300 - 9997453897*n^3/21 + 85979117831*n^2/140 + 13635070421*n/5 - 5609601346, for n>=9.

G.f.: -2*x^7*(97581*x^22 - 1758956*x^21 + 16320562*x^20 - 100734462*x^19 + 443795293*x^18 - 1471049082*x^17 + 3971393292*x^16 - 9304893422*x^15 + 17917931016*x^14 - 22612415810*x^13 + 6949925614*x^12 + 21430418050*x^11 + 9738010368*x^10 - 153051533038*x^9 + 256884162558*x^8 - 71451647970*x^7 - 265785285277*x^6 + 220345759446*x^5 + 251887022384*x^4 + 63841610284*x^3 + 5432696107*x^2 + 140661216*x + 800646)/(x-1)^21.

cp's OEIS Frontend

A063443 Number of ways to tile an n X n square with 1 X 1 and 2 X 2 tiles.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Formula

Extensions

A236679 Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X n square under all symmetry operations of the square; irregular triangle T(n,k), n>=2, 0<=k<=floor(n/2)^2, read by rows.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A061996 Number of ways to place 3 nonattacking kings on an n X n board.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

SageMath

Formula

A061997 Number of ways to place 4 nonattacking kings on an n X n board.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

SageMath

Formula

A061998 Number of ways to place 5 nonattacking kings on an n X n board.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

SageMath

Formula

A201513 Number of ways to place n nonattacking kings on an n X n board.

Views

Author

Keywords

Links

Crossrefs

Formula

Extensions

A286436 Irregular triangle read by rows: T(n, k) = number of ways to tile an n X n X n triangular area with k 2 X 2 X 2 triangular tiles and an appropriate number (= n^2-4*k) of 1 X 1 X 1 tiles.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A201369 Number of ways to place 8 nonattacking kings on an n X n board.

Views

Author

Keywords

Links

Crossrefs

Formula

A201771 Number of ways to place 9 nonattacking kings on an n X n board.

Views

Author