A174154 -id:A174154 - cp's OEIS frontend

A018807 Number of ways to place n^2 nonattacking kings on 2n X 2n chessboard.

1, 4, 79, 3600, 281571, 32572756, 5109144543, 1027533353168, 254977173389319, 75925129079783308, 26568150968269086211, 10749154284380665611224, 4963704194366362387891227, 2588716234142991968960920692, 1511548995678989691821551648635

Offset: 0

David W. Wilson

Rotations and reflections are considered distinct.
Also, number of ways to tile a (2n+1) X (2n+1) board with n^2 2 X 2 tiles and 4n+1 1 X 1 tiles, rotations and reflections counted as distinct. - David W. Wilson, Aug 18 2011
Number of maximum independent vertex sets in the 2n X 2n king graph. - Eric W. Weisstein, Jun 20 2017

David W. Wilson, Table of n, a(n) for n = 0..26
Zealint Blog (Russian) Source for a(12) through a(20), March 14 2011. a(21) through a(26) from same source, July 9 2011.
Tricia Muldoon Brown, Queens, Attack!, The Mathematical Intelligencer (2020).
Tricia Muldoon Brown, Maximum arrangements of nonattacking kings on the 2n × 2n chessboard, Georgia Southern University (2020).
Vaclav Kotesovec, Non-attacking chess pieces, 6ed, 2013, pp. 160-162.
Michael Larsen, The Problem of Kings, The Electronic Journal of Combinatorics 2, 1995
Eric Weisstein's World of Mathematics, King Graph
Eric Weisstein's World of Mathematics, Maximum Independent Vertex Set

Main diagonal of A350819.

Cf. A174558, A174155, A174154, A173782, A173783, A061594, A061593.

Asymptotic (M. Larsen, 1995): log(a(n)) = 2n*log(n) - 2n*log(2) + O(n^(4/5)*log(n)).

a(0) added by Geoffrey H. Morley, Feb 06 2013

A350819 Array read by antidiagonals: T(m,n) is the number of maximum independent sets in the 2m X 2n king graph.

Original entry on oeis.org

1, 1, 1, 1, 4, 1, 1, 12, 12, 1, 1, 32, 79, 32, 1, 1, 80, 408, 408, 80, 1, 1, 192, 1847, 3600, 1847, 192, 1, 1, 448, 7698, 26040, 26040, 7698, 448, 1, 1, 1024, 30319, 166368, 281571, 166368, 30319, 1024, 1, 1, 2304, 114606, 976640, 2580754, 2580754, 976640, 114606, 2304, 1

Offset: 0

Andrew Howroyd, Jan 17 2022

Number of ways to tile a (2m+1) X (2n+1) board with m*n 2 X 2 tiles and 2m+2n+1 1 X 1 tiles.

For m,n > 0, T(m,n) is the number of minimum dominating sets in the (3m-1) X (3n-1) king graph.

			Table begins:
=============================================
m\n | 0   1    2      3       4        5
----+----------------------------------------
  0 | 1   1    1      1       1        1 ...
  1 | 1   4   12     32      80      192 ...
  2 | 1  12   79    408    1847     7698 ...
  3 | 1  32  408   3600   26040   166368 ...
  4 | 1  80 1847  26040  281571  2580754 ...
  5 | 1 192 7698 166368 2580754 32572756 ...
  ...

Eric Weisstein's World of Mathematics, King Graph
Eric Weisstein's World of Mathematics, Maximum Independent Vertex Set

Rows 0..12 are A000012, A001787(n+1), A061593, A061594, A173782, A173783, A174154, A174155, A174558, A195648, A195649, A195650, A195651.
Main diagonal is A018807.
Cf. A350815, A350818.

T(m,n) = T(n,m).

T(m,n) = A350818(2*m, 2*n) = A350815(3*m-1, 3*n-1).

A174558 Number of ways to place 8n nonattacking kings on a 16 x 2n chessboard.

Original entry on oeis.org

2304, 419933, 28432288, 1134127305, 32580145116, 749160010737, 14677177838054, 254977173389319, 4035559337688370, 59315924213143597, 821112680030028632, 10819171744710664383, 136800806311499633208, 1670597119210336446533, 19804685547188544317522, 228865023358344707514899, 2586924156960003793687130, 28681715460054576813151389, 312656761422008821513384848, 3357651442822195404605813501

Offset: 1

Vaclav Kotesovec, Nov 29 2010

nonn

Vaclav Kotesovec, Table of n, a(n) for n = 1..1000
Vaclav Kotesovec, Non-attacking chess pieces, 6ed, 2013
Vaclav Kotesovec, G.f.
Index entries for linear recurrences with constant coefficients, order 307.

Column k=8 of A350819.

Cf. A174155, A174154, A173782, A173783, A061594, A061593, A018807.

Asymptotic formula for number of ways to place m x n nonattacking kings on a 2m x 2n chessboard (this case is m=8): f(m,n) ~ k(m)*n*(m+1)^n
First values of k(m):
k(1)=1,
k(2)=17,
k(3)=231,
k(4)=3051.17509,
k(5)=40881.99638,
k(6)=563050.92363,
k(7)=8008508.28858,
k(8)=117833087.45133
k(9)=1794306724.77472
k(10)=28276454469.76459
k(11)=461049875818.05305
k(12)=7775513990776.97046
k(13)=135589372611110.17367
k(14)=2443990803097108.58764
k(15)=45522076785406201.22572
k(16)=875939597341977670.66777
k(17)=17407856624734801679.11613
k(18)=357216046100723515478.42809
k(19)=7567101689641721175327.80272

A174155 Number of ways to place 7n nonattacking kings on a 14 x 2n chessboard.

Original entry on oeis.org

1, 1024, 114606, 5392704, 159636030, 3544192112, 64737165162, 1027533353168, 14677177838054, 193194265398240, 2383116363555182, 27889602664055396, 312546900470579954, 3378090945290324892, 35412239480510055916, 361670315347336810428, 3611858972942315054336, 35375586671457852212944

Offset: 0

Vaclav Kotesovec, Mar 10 2010

nonn

Ray Chandler, Table of n, a(n) for n = 0..1096
Vaclav Kotesovec, Number of ways of placing non-attacking queens and kings on boards of various sizes
Vaclav Kotesovec, G.f.
Index entries for linear recurrences with constant coefficients, order 124.

Column k=7 of A350819.

Cf. A018807, A061594, A061593, A173782, A173783, A174154.

More terms from Jinyuan Wang, Feb 26 2020

a(0)=1 prepended by Andrew Howroyd, Mar 26 2023

A194648 Number of ways to place 6n nonattacking kings on a 12 X 2n cylindrical chessboard.

Original entry on oeis.org

448, 1732, 7918, 39316, 205628, 1118398, 6286658, 36383284, 216134044, 1314160492, 8155899320, 51526819510, 330559583178, 2148524237842, 14120142260138, 93669254201140, 626289974615094, 4215364545901036, 28531464984810918, 194028126730583796

Offset: 1

Vaclav Kotesovec, Aug 31 2011

nonn

This cylinder is horizontal: a chessboard where it is supposed that rows 1 and 2n are in contact (number of columns = 12, number of rows = 2n).

Ray Chandler, Table of n, a(n) for n = 1..1182
V. Kotesovec, Number of ways of placing non-attacking queens, kings, bishops and knights
Vaclav Kotesovec, G.f., recurrence and explicit formula
Index entries for linear recurrences with constant coefficients, signature (123, -7321, 280953, -7815096, 167948132, -2902322885, 41450235787, -499005760654, 5139688443504, -45815780494341, 356686744049422, -2442977988253415, 14807521518627422, -79813193163925620, 384075945698236159, -1655461203049171846, 6408095608117333736, -22324060511037585983, 70110767534529096739, -198758740577568913437, 509105053427808565774, -1178957762144560119277, 2469102261987638350625, -4676788353519183205994, 8009846446628877143184, -12398045659209581154381, 17330242433059284917247, -21854027730161965985121, 24829391878777653306741, -25375425632156076733736, 23283124318667970185580, -19136737348463193623732, 14052187658858602811086, -9190302655918861018594, 5334155219056391326621, -2736099335631729732358, 1234232572662337908295, -486797186990900726158, 166723091105251092029, -49174878927647152193, 12365157710942649267, -2617610437109862140, 459103033290045078, -65327706620774553, 7328352058508736, -621736878459564, 37366066553760, -1412422401600, 25147584000).

Cf. A174154, A194644, A194645, A194646, A194647, A137432, A195594.

Asymptotic: a(n) ~ 2*7^n.

A195594 Number of ways to place 6n nonattacking kings on a vertical cylinder 12 X 2n.

Original entry on oeis.org

128, 2102, 15988, 81606, 327192, 1118398, 3419648, 9643562, 25603228, 64923594, 158877948, 378088270, 879980720, 2011806182, 4532900488, 10091643138, 22244251284, 48622120786, 105526014500, 227633451206, 488451508168, 1043298475662, 2219419264848

Offset: 1

Vaclav Kotesovec, Sep 21 2011

nonn

Vertical cylinder: a chessboard where it is supposed that the columns 1 and 12 are in contact (number of columns = 12, number of rows = 2n).

Ray Chandler, Table of n, a(n) for n = 1..3296
V. Kotesovec, Non-attacking chess pieces
Index entries for linear recurrences with constant coefficients, signature (9, -34, 70, -85, 61, -24, 4).

Cf. A194648, A174154, A137432.

LinearRecurrence[{9,-34,70,-85,61,-24,4},{128,2102,15988,81606,327192,1118398,3419648},30] (* Harvey P. Dale, Aug 06 2024 *)

Recurrence: a(n) = 4*a(n-7) - 24*a(n-6) + 61*a(n-5) - 85*a(n-4) + 70*a(n-3) - 34*a(n-2) + 9*a(n-1).
G.f.: -(1 + 119*x + 984*x^2 + 1352*x^3 + 307*x^4 + 9*x^5)/((x-1)^5*(2*x-1)^2).
a(n) = (15839*n - 99729)*2^n + 231/2*n^4 + 1767*n^3 + 26001/2*n^2 + 53295*n + 99730.

cp's OEIS Frontend

A018807 Number of ways to place n^2 nonattacking kings on 2n X 2n chessboard.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

Extensions

A350819 Array read by antidiagonals: T(m,n) is the number of maximum independent sets in the 2m X 2n king graph.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A174558 Number of ways to place 8n nonattacking kings on a 16 x 2n chessboard.

Views

Author

Keywords

Links

Crossrefs

Formula

A174155 Number of ways to place 7n nonattacking kings on a 14 x 2n chessboard.

Views

Author

Keywords

Links

Crossrefs

Extensions

A194648 Number of ways to place 6n nonattacking kings on a 12 X 2n cylindrical chessboard.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula

A195594 Number of ways to place 6n nonattacking kings on a vertical cylinder 12 X 2n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula