A279112 -id:A279112 - cp's OEIS frontend

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.

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)

A279111 Number of non-equivalent ways to place 2 non-attacking kings on an n X n board.

Original entry on oeis.org

0, 0, 4, 13, 37, 75, 147, 246, 406, 610, 910, 1275, 1779, 2373, 3157, 4060, 5212, 6516, 8136, 9945, 12145, 14575, 17479, 20658, 24402, 28470, 33202, 38311, 44191, 50505, 57705, 65400, 74104, 83368, 93772, 104805, 117117, 130131, 144571, 159790, 176590, 194250, 213654

Offset: 1

Heinrich Ludwig, Dec 06 2016

Rotations and reflections of placements are not counted. If they are to be counted, see A061995.

			There are 4 non-equivalent ways to place 2 non-attacking kings on a 3 X 3 board:
   K.K   K..   K..   .K.
   ...   ..K   ...   ...
   ...   ...   ..K   .K.

Heinrich Ludwig, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (2,2,-6,0,6,-2,-2,1).

Cf. A061995, A279112 (3 kings), A279113 (4 kings), A279114 (5 kings), A279115 (6 kings), A279116 (7 kings), A279117, A236679.

Table[(n^4 - 2 n^2 - 4 n + Boole[OddQ@ n] (2 n^2 - 4 n + 7))/16, {n, 43}] (* or *)
Rest@ CoefficientList[Series[x^3*(4 + 5 x + 3 x^2 - x^3 + x^4)/((1 - x)^5*(1 + x)^3), {x, 0, 43}], x] (* Michael De Vlieger, Dec 08 2016 *)

concat(vector(2), Vec(x^3*(4 + 5*x + 3*x^2 - x^3 + x^4) / ((1 - x)^5*(1 + x)^3) + O(x^60))) \\ Colin Barker, Dec 07 2016

a(n) = (n^4 - 2*n^2 - 4*n + IF(MOD(n, 2) = 1, 2*n^2 - 4*n + 7))/16.
a(n) = (2*n^4 - 2*n^2 - 12*n + 7 - (2*n^2 - 4*n + 7)*(-1)^n)/32. - Bruno Berselli, Dec 07 2016
a(n) = 2*a(n-1) + 2*a(n-2) - 6*a(n-3) + 6*a(n-5) - 2*a(n-6) - 2*a(n-7) + a(n-8).
From Colin Barker, Dec 07 2016: (Start)
a(n) = n*(n - 2)*(n^2 + 2*n + 2)/16 for n even.
a(n) = (n - 1)*(n^3 + n^2 + n - 7)/16 for n odd.
G.f.: x^3*(4 + 5*x + 3*x^2 - x^3 + x^4) / ((1 - x)^5*(1 + x)^3).
(End)

A279113 Number of non-equivalent ways to place 4 non-attacking kings on an n X n board.

Original entry on oeis.org

0, 0, 1, 14, 277, 2154, 10855, 39926, 120961, 315150, 737089, 1577406, 3150841, 5934034, 10651567, 18332614, 30452605, 49011606, 76753681, 117268590, 175315789, 256949306, 369978631, 524114454, 731604457, 1007394974, 1369985905, 1841600286, 2449309201, 3225197730

Offset: 1

Heinrich Ludwig, Dec 07 2016

Rotations and reflections of placements are not counted. If they are to be counted, see A061997.

			There is 1 way to place 4 non-attacking kings on a 3 X 3 board:
   K.K
   ...
   K.K

Heinrich Ludwig, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (4,-1,-16,19,20,-45,0,45,-20,-19,16,1,-4,1)

Cf. A061997, A279111 (2 kings), A279112 (3 kings), A279114 (5 kings), A279115 (6 kings), A279116 (7 kings), A279117, A236679.

Table[Boole[n > 2] (n^8 - 54 n^6 + 72 n^5 + 1024 n^4 - 2640 n^3 - 4928 n^2 + 21888 n - 17280 + Boole[OddQ@ n] (14 n^4 - 72 n^3 + 154 n^2 - 240 n - 51))/192, {n, 30}] (* or *)
Rest@ CoefficientList[Series[x^3*(1 + 10 x + 222 x^2 + 1076 x^3 + 2721 x^4 + 2806 x^5 + 1078 x^6 - 924 x^7 - 639 x^8 + 202 x^9 + 236 x^10 - 40 x^11 - 35 x^12 + 6 x^13)/((1 - x)^9*(1 + x)^5), {x, 0, 30}], x] (* Michael De Vlieger, Dec 08 2016 *)

concat(vector(2), Vec(x^3*(1 +10*x +222*x^2 +1076*x^3 +2721*x^4 +2806*x^5 +1078*x^6 -924*x^7 -639*x^8 +202*x^9 +236*x^10 -40*x^11 -35*x^12 +6*x^13) / ((1 -x)^9*(1 +x)^5) + O(x^40))) \\ Colin Barker, Dec 08 2016

a(n) = (n^8 - 54*n^6 + 72*n^5 + 1024*n^4 - 2640*n^3 - 4928*n^2 + 21888*n - 17280 + IF(MOD(n, 2) = 1, 14*n^4 - 72*n^3 + 154*n^2 - 240*n - 51))/192 for n>=3.
a(n) = 4*a(n-1) - a(n-2) - 16*a(n-3) + 19*a(n-4) + 20*a(n-5) - 45*a(n-6) + 45*a(n-8) - 20*a(n-9) - 19*a(n-10) + 16*a(n-11) + a(n-12) - 4*a(n-13) + a(n-14) for n>=17.
G.f.: x^3*(1 +10*x +222*x^2 +1076*x^3 +2721*x^4 +2806*x^5 +1078*x^6 -924*x^7 -639*x^8 +202*x^9 +236*x^10 -40*x^11 -35*x^12 +6*x^13) / ((1 -x)^9*(1 +x)^5). - Colin Barker, Dec 08 2016

A279114 Number of non-equivalent ways to place 5 non-attacking kings on an n X n board.

Original entry on oeis.org

0, 0, 0, 0, 273, 5335, 50021, 291171, 1263125, 4434783, 13355477, 35672426, 86686721, 194886975, 410820269, 819819261, 1561128613, 2853802623, 5033838173, 8602315716, 14291999441, 23150803815, 36654054741, 56841404455, 86496828245, 129363299967, 190419751685, 276205278030

Offset: 1

Heinrich Ludwig, Dec 08 2016

Rotations and reflections of placements are not counted. If they are to be counted, see A061998.

			There are 273 non-equivalent ways to place 5 non-attacking kings on a 5 X 5 board, e.g., this one:
   K...K
   .....
   ..K..
   .....
   K...K

Heinrich Ludwig, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (5,-4,-20,40,16,-100,44,110,-110,-44,100,-16,-40,20,4,-5,1).

Cf. A061998, A279111 (2 kings), A279112 (3 kings), A279113 (4 kings), A279115 (6 kings), A279116 (7 kings), A279117, A236679.

[0,0,0] cat [(n^10 - 90*n^8 + 120*n^7 + 3115*n^6 - 7748*n^5 - 46050*n^4 + 173140*n^3 + 158584*n^2 - 1255952*n + 1252800 + (1/2-(-1)^n/2)*(52*n^5 - 305*n^4 + 180*n^3 + 320*n^2 + 3488*n - 375))/960 : n in [4..30]]; // Wesley Ivan Hurt, Dec 08 2016

A279114:=n->(n^10 - 90*n^8 + 120*n^7 + 3115*n^6 - 7748*n^5 - 46050*n^4 + 173140*n^3 + 158584*n^2 - 1255952*n + 1252800 + (1/2-(-1)^n/2)*(52*n^5 - 305*n^4 + 180*n^3 + 320*n^2 + 3488*n - 375))/960: 0, 0, 0, seq(A279114(n), n=4..30); # Wesley Ivan Hurt, Dec 08 2016

Join[{0, 0, 0}, Table[(n^10 - 90*n^8 + 120*n^7 + 3115*n^6 - 7748*n^5 - 46050*n^4 + 173140*n^3 + 158584*n^2 - 1255952*n + 1252800 + (1/2 - (-1)^n/2)*(52*n^5 - 305*n^4 + 180*n^3 + 320*n^2 + 3488*n - 375))/960, {n, 4, 30}]] (* Wesley Ivan Hurt, Dec 08 2016 *)

concat(vector(4), Vec(x^5*(273 +3970*x +24438*x^2 +67866*x^3 +103134*x^4 +66494*x^5 -1418*x^6 -29015*x^7 -4247*x^8 +10650*x^9 +2718*x^10 -2696*x^11 -672*x^12 +382*x^13 +62*x^14 -19*x^15) / ((1 -x)^11*(1 +x)^6) + O(x^30))) \\ Colin Barker, Dec 08 2016

a(n) = (n^10 - 90*n^8 + 120*n^7 + 3115*n^6 - 7748*n^5 - 46050*n^4 + 173140*n^3 + 158584*n^2 - 1255952*n + 1252800 + (1/2-(-1)^n/2) * (52*n^5 - 305*n^4 + 180*n^3 + 320*n^2 + 3488*n - 375))/960 for n >= 4.
a(n) = 5*a(n-1) - 4*a(n-2) - 20*a(n-3) + 40*a(n-4) + 16*a(n-5) - 100*a(n-6) + 44*a(n-7) + 110*a(n-8) - 110*a(n-9) - 44*a(n-10) + 100*a(n-11) - 16*a(n-12) - 40*a(n-13) + 20*a(n-14) + 4*a(n-15) - 5*a(n-16) + a(n-17) for n >= 21.
G.f.: x^5*(273 +3970*x +24438*x^2 +67866*x^3 +103134*x^4 +66494*x^5 -1418*x^6 -29015*x^7 -4247*x^8 +10650*x^9 +2718*x^10 -2696*x^11 -672*x^12 +382*x^13 +62*x^14 -19*x^15) / ((1 -x)^11*(1 +x)^6). - Colin Barker, Dec 08 2016

A279115 Number of non-equivalent ways to place 6 non-attacking kings on an n X n board.

Original entry on oeis.org

0, 0, 0, 0, 143, 7855, 153311, 1505465, 9729830, 47235703, 186615092, 630338668, 1882894541, 5092130575, 12686490993, 29498296651, 64664954532, 134715649055, 268438970166, 514318521438, 951646716171, 1706721390223, 2976056379875, 5058962536429, 8402677784738, 13663807273607

Offset: 1

Heinrich Ludwig, Dec 09 2016

Rotations and reflections of placements are not counted. If they are to be counted, see A172158.

			There are 143 non-equivalent ways to place 6 non-attacking kings on a 5 X 5 board, e.g., this one:
   K...K
   .....
   K...K
   .....
   K...K

Heinrich Ludwig, Table of n, a(n) for n = 1..1000
Index entries for linear recurrences with constant coefficients, signature (6,-8,-22,69,-8,-176,168,182,-364,0,364,-182,-168,176,8,-69,22,8,-6,1).

Cf. A172158, A279111 (2 kings), A279112 (3 kings), A279113 (4 kings), A279114 (5 kings), A279116 (7 kings), A279117, A236679.

concat(vector(4), Vec(x^5*(143 +6997*x +107325*x^2 +651585*x^3 +2086471*x^4 +3732434*x^5 +3669293*x^6 +1297859*x^7 -708745*x^8 -592136*x^9 +247421*x^10 +258649*x^11 -53671*x^12 -77714*x^13 +4451*x^14 +14969*x^15 +1018*x^16 -1741*x^17 -234*x^18 +106*x^19) / ((1 -x)^13*(1 +x)^7) + O(x^30))) \\ Colin Barker, Dec 09 2016

a(n) = (n^12 - 135*n^10 + 180*n^9 + 7465*n^8 - 18840*n^7 - 202468*n^6 + 749880*n^5 + 2446764*n^4 - 13439400*n^3 - 3570352*n^2 + 89413920*n - 107694720 + IF(MOD(n, 2) = 1, 122*n^6 - 1020*n^5 + 1955*n^4 + 840*n^3 + 5753*n^2 - 42840*n + 132975))/5760 for n>=5.
a(n) = 6*a(n-1) - 8*a(n-2) - 22*a(n-3) + 69*a(n-4) - 8*a(n-5) - 176*a(n-6) + 168*a(n-7) + 182*a(n-8) - 364*a(n-9) + 364*a(n-11) - 182*a(n-12) - 168*a(n-13) + 176*a(n-14) + 8*a(n-15) - 69*a(n-16) + 22*a(n-17) + 8*a(n-18) - 6*a(n-19) + a(n-20) for n>=25.
G.f.: x^5*(143 +6997*x +107325*x^2 +651585*x^3 +2086471*x^4 +3732434*x^5 +3669293*x^6 +1297859*x^7 -708745*x^8 -592136*x^9 +247421*x^10 +258649*x^11 -53671*x^12 -77714*x^13 +4451*x^14 +14969*x^15 +1018*x^16 -1741*x^17 -234*x^18 +106*x^19) / ((1 -x)^13*(1 +x)^7). - Colin Barker, Dec 09 2016

A279116 Number of non-equivalent ways to place 7 non-attacking kings on an n X n board.

Original entry on oeis.org

0, 0, 0, 0, 39, 6472, 311552, 5576682, 56289710, 389130774, 2059061646, 8924241327, 33134160010, 108698226956, 322211640480

Offset: 1

Heinrich Ludwig, Dec 10 2016

Rotations and reflections of placements are not counted. If they are to be counted, see A194788.

			There are 39 non-equivalent ways to place 7 non-attacking kings on a 5 X 5 board, e.g., this one:
   K...K
   .....
   K.K.K
   .....
   K...K

Cf. A194788, A279111 (2 kings), A279112 (3 kings), A279113 (4 kings), A279114 (5 kings), A279115 (6 kings), A279117, A236679.

A279117 Number of non-equivalent ways to place n non-attacking kings on an n X n board.

Original entry on oeis.org

1, 0, 2, 14, 273, 7855, 311552, 14895797, 831959075, 52959962415

Offset: 1

Heinrich Ludwig, Dec 10 2016

Rotations and reflections of placements are not counted. If they are to be counted, see A201513.

			There are 14 non-equivalent ways to place 4 non-attacking kings on a 4 X 4 board, e.g., this one:
   K..K
   ....
   ....
   K..K

Cf. A201513, A279111 (2 kings), A279112 (3 kings), A279113 (4 kings), A279114 (5 kings), A279115 (6 kings), A279116 (7 kings), A236679.

A286445 Number of non-equivalent ways to tile an n X n X n triangular area with three 2 X 2 X 2 triangular tiles and an appropriate number (= n^2-12) of 1 X 1 X 1 tiles.

Original entry on oeis.org

0, 2, 14, 97, 398, 1290, 3366, 7731, 15888, 30248, 53850, 91147, 147496, 230290, 348148, 512457, 736204, 1035986, 1430420, 1942691, 2598470, 3429064, 4468784, 5758755, 7343670, 9276330, 11613714, 14422313, 17773458, 21749506, 26438362, 31940587, 38363044, 45826992

Offset: 3

Heinrich Ludwig, May 12 2017

Rotations and reflections of tilings are not counted. If they are to be counted, see A286438. Tiles of the same size are indistinguishable.

For an analogous problem concerning square tiles, see A279112.

			There are 2 non-equivalent ways of tiling a triangular area of side 4 with three tiles of side 2 and an appropriate number (= 4) of tiles of side 1. See example in links section.

Heinrich Ludwig, Table of n, a(n) for n = 3..100
Heinrich Ludwig, Illustration of tiling a 4X4X4 area
Index entries for linear recurrences with constant coefficients, signature (3,0,-7,3,6,0,-6,-3,7,0,-3,1).

Cf. A279112, A286438, A286443, A286444, A286446.

concat(0, Vec(x^4*(2 + 8*x + 55*x^2 + 121*x^3 + 188*x^4 + 121*x^5 + 44*x^6 - 39*x^7 - 22*x^8 - 5*x^9 + 5*x^10 + 2*x^11) / ((1 - x)^7*(1 + x)^3*(1 + x + x^2)) + O(x^60))) \\ Colin Barker, May 12 2017

a(n) = (n^6 -9*n^5 +6*n^4 +165*n^3 -447*n^2 -372*n +1736)/36 + IF(MOD(n, 2) = 1, -n^2 +6*n -9)/2 + IF(MOD(n, 3) = 0, -2)/9 for n >= 4.

G.f.: x^4*(2 + 8*x + 55*x^2 + 121*x^3 + 188*x^4 + 121*x^5 + 44*x^6 - 39*x^7 - 22*x^8 - 5*x^9 + 5*x^10 + 2*x^11) / ((1 - x)^7*(1 + x)^3*(1 + x + x^2)). - Colin Barker, May 12 2017

cp's OEIS Frontend

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

A279111 Number of non-equivalent ways to place 2 non-attacking kings on an n X n board.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A279113 Number of non-equivalent ways to place 4 non-attacking kings on an n X n board.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A279114 Number of non-equivalent ways to place 5 non-attacking kings on an n X n board.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A279115 Number of non-equivalent ways to place 6 non-attacking kings on an n X n board.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula

A279116 Number of non-equivalent ways to place 7 non-attacking kings on an n X n board.

Views

Author

Keywords

Comments

Examples

Crossrefs

A279117 Number of non-equivalent ways to place n non-attacking kings on an n X n board.

Views

Author

Keywords

Comments

Examples

Crossrefs

A286445 Number of non-equivalent ways to tile an n X n X n triangular area with three 2 X 2 X 2 triangular tiles and an appropriate number (= n^2-12) of 1 X 1 X 1 tiles.

Views

Author

Keywords

Comments

Examples