A228022 -id:A228022 - cp's OEIS frontend

A238189 Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 4 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=n-n%2, read by rows.

1, 2, 1, 1, 2, 2, 1, 4, 7, 3, 1, 1, 4, 13, 10, 4, 1, 6, 23, 33, 22, 6, 1, 1, 6, 34, 68, 72, 30, 6, 1, 8, 49, 139, 204, 145, 54, 8, 1, 1, 8, 65, 230, 467, 476, 269, 70, 9, 1, 10, 85, 377, 961, 1348, 1080, 472, 111, 12, 1, 1, 10, 106, 552, 1767, 3188, 3454, 2156

Offset: 2

Christopher Hunt Gribble, Feb 19 2014

			The first 10 rows of T(n,k) are:
  k  0     1     2     3     4     5     6     7     8     9    10
n
2    1     2     1
3    1     2     2
4    1     4     7     3     1
5    1     4    13    10     4
6    1     6    23    33    22     6     1
7    1     6    34    68    72    30     6
8    1     8    49   139   204   145    54     8     1
9    1     8    65   230   467   476   269    70     9
10   1    10    85   377   961  1348  1080   472   111    12     1
11   1    10   106   552  1767  3188  3454  2156   779   140    12

Andrew Howroyd, Table of n, a(n) for n = 2..967 (terms n=2..127 from Christopher Hunt Gribble)
Christopher Hunt Gribble, C++ program

Cf. A034851, A226048, A102541, A226290, A238009, A228570, A225812, A238190, A228572, A228022, A231145, A231473, A231568, A232440, A228165, A238550, A238551, A238552, A228166, A238555, A238556, A228167, A238557, A238558, A238559, A228168, A238581, A238582, A238583, A228169, A238586, A238592.

Terms corrected and extended by Christopher Hunt Gribble, Apr 25 2015

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

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 3, 4, 1, 3, 8, 1, 4, 12, 3, 1, 4, 18, 8, 1, 5, 24, 22, 1, 5, 32, 40, 6, 1, 6, 40, 73, 22, 1, 6, 50, 112, 66, 1, 7, 60, 172, 146, 10, 1, 7, 72, 240, 292, 48, 1, 8, 84, 335, 516, 174, 1, 8, 98, 440, 860, 448, 20

Offset: 3

Christopher Hunt Gribble, Feb 19 2014

			The first 13 rows of T(n,k) are:
.\ k    0     1     2     3     4     5
n
3       1     1
4       1     1
5       1     2
6       1     2     2
7       1     3     4
8       1     3     8
9       1     4    12     3
10      1     4    18     8
11      1     5    24    22
12      1     5    32    40     6
13      1     6    40    73    22
14      1     6    50   112    66
15      1     7    60   172   146    10

Andrew Howroyd, Table of n, a(n) for n = 3..974
Christopher Hunt Gribble, C++ program

Cf. A034851, A226048, A102541, A226290, A238009, A228570, A225812, A238189, A228572, A228022, A231145, A231473, A231568, A232440, A228165, A238550, A238551, A238552, A228166, A238555, A238556, A228167, A238557, A238558, A238559, A228168, A238581, A238582, A238583, A228169, A238586, A238592.

T[n_, k_] := (2^k Binomial[n - 2k, k] + (Boole[EvenQ[k]] + Boole[OddQ[n] || EvenQ[k]] + Boole[k == 0]) 2^Quotient[k + 1, 2] Binomial[(n - 2k - Mod[n, 2])/2, Quotient[k, 2]])/4; Table[T[n, k], {n, 3, 20}, {k, 0, Floor[n/3]}] // Flatten (* Jean-François Alcover, Oct 06 2017, after Andrew Howroyd *)

T(n,k)={(2^k*binomial(n-2*k,k) + ((k%2==0)+(n%2==1||k%2==0)+(k==0)) * 2^((k+1)\2)*binomial((n-2*k-(n%2))/2,k\2))/4}
for(n=2,20,for(k=0,floor(n/3), print1(T(n,k), ", "));print) \\ Andrew Howroyd, May 29 2017

Link to C++ program and xrefs updated by Christopher Hunt Gribble, Apr 25 2015

Terms a(51) and beyond from Andrew Howroyd, May 29 2017

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

Original entry on oeis.org

1, 3, 4, 1, 1, 3, 8, 3, 1, 6, 23, 33, 22, 6, 1, 1, 6, 40, 101, 125, 54, 10, 1, 9, 68, 262, 534, 532, 276, 74, 12, 1, 1, 9, 98, 509, 1551, 2505, 2196, 971, 219, 20, 1, 12, 139, 927, 3731, 8772, 12069, 9506, 4366, 1160, 179, 16, 1, 1, 12, 182, 1479, 7644, 24024

Offset: 2

Christopher Hunt Gribble, Feb 28 2014

			The first 6 rows of T(n,k) are:
.\ k  0     1     2     3     4     5     6     7     8     9
n
2     1     3     4     1
3     1     3     8     3
4     1     6    23    33    22     6     1
5     1     6    40   101   125    54    10
6     1     9    68   262   534   532   276    74    12     1
7     1     9    98   509  1551  2505  2196   971   219    20

Andrew Howroyd, Table of n, a(n) for n = 2..953 (terms n=2..69 from Christopher Hunt Gribble)
Christopher Hunt Gribble, C++ program

Cf. A034851, A226048, A102541, A226290, A238009, A228570, A225812, A238189, A238190, A228572, A228022, A231145, A231473, A231568, A232440, A228165, A238551, A238552, A228166, A238555, A238556, A228167, A238557-A238559, A228168, A238581-A238583, A228169, A238586, A238592.

Terms corrected and xrefs updated by Christopher Hunt Gribble, Apr 26 2015

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

Original entry on oeis.org

1, 2, 1, 2, 1, 4, 1, 4, 1, 6, 4, 1, 6, 9, 1, 8, 18, 1, 8, 28, 1, 10, 42, 10, 1, 10, 57, 28, 1, 12, 76, 76, 1, 12, 96, 140, 1, 14, 120, 254, 25, 1, 14, 145, 392, 107, 1, 16, 174, 600, 321, 1, 16, 204, 840, 731, 1, 18, 238, 1170, 1462, 70, 1, 18, 273, 1540, 2610, 366

Offset: 4

Christopher Hunt Gribble, Feb 28 2014

			The first 14 rows of T(n,k) are:
.\ k    0      1      2      3     4
n
4       1      2
5       1      2
6       1      4
7       1      4
8       1      6      4
9       1      6      9
10      1      8     18
11      1      8     28
12      1     10     42     10
13      1     10     57     28
14      1     12     76     76
15      1     12     96    140
16      1     14    120    254    25
17      1     14    145    392   107

Andrew Howroyd, Table of n, a(n) for n = 4..989
Christopher Hunt Gribble, C++ program

Cf. A034851, A226048, A102541, A226290, A238009, A228570, A225812, A238189, A238190, A228572, A228022, A231145, A231473, A231568, A232440, A228165, A238550, A238551, A228166, A238555, A238556, A228167, A238557, A238558, A238559, A228168, A238581, A238582, A238583, A228169, A238586, A238592.

T[n_, k_] := ((3^k + 1) Binomial[n - 3k, k] + Boole[EvenQ[k] || EvenQ[n]]*(3^Quotient[k + 1, 2] + 3^Quotient[k, 2]) * Binomial[(n - 3k - Mod[k, 2] - Mod[n, 2])/2, Quotient[k, 2]])/4; Table[T[n, k], {n, 4, 20}, {k, 0, Floor[n/4]}] // Flatten (* Jean-François Alcover, Oct 06 2017, after Andrew Howroyd *)

T(n,k)={((3^k+1)*binomial(n-3*k,k) + (k%2==0||n%2==0) * (3^((k+1)\2)+3^(k\2)) * binomial((n-3*k-(k%2)-(n%2))/2,k\2))/4}
for(n=4,20,for(k=0,floor(n/4), print1(T(n,k), ", "));print) \\ Andrew Howroyd, May 29 2017

Terms corrected and xrefs updated by Christopher Hunt Gribble, Apr 27 2015

Terms a(28) and beyond from Andrew Howroyd, May 29 2017

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

Original entry on oeis.org

1, 3, 6, 2, 1, 3, 12, 8, 1, 6, 34, 68, 72, 30, 6, 1, 6, 58, 206, 403, 336, 106, 1, 9, 98, 509, 1551, 2505, 2196, 971, 219, 20, 1, 9, 140, 980, 4248, 10592, 15614, 12876, 5462, 900, 1, 12, 198, 1742, 9748, 33644, 73274, 98779, 80661, 37886, 9679, 1258, 72

Offset: 2

Christopher Hunt Gribble, Feb 28 2014

			The first 6 rows of T(n,k) are:
./ k  0     1     2     3     4     5     6     7     8     9
n
2     1     3     6     2
3     1     3    12     8
4     1     6    34    68    72    30     6
5     1     6    58   206   403   336   106
6     1     9    98   509  1551  2505  2196   971   219    20
7     1     9   140   980  4248 10592 15614 12876  5462   900

Andrew Howroyd, Table of n, a(n) for n = 2..953
Christopher Hunt Gribble, C++ program

Cf. A034851, A226048, A102541, A226290, A238009, A228570, A225812, A238189, A238190, A228572, A228022, A231145, A231473, A231568, A232440, A228165, A238550, A238551, A238552, A228166, A238556, A228167, A238557, A238558, A238559, A228168, A238581, A238582, A238583, A228169, A238586, A238592.

Terms corrected and xrefs updated by Christopher Hunt Gribble, Apr 27 2015

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

Original entry on oeis.org

1, 3, 2, 1, 3, 4, 1, 6, 9, 1, 6, 21, 13, 4, 1, 9, 39, 53, 23, 1, 9, 64, 128, 87, 1, 12, 95, 283, 311, 91, 10, 1, 12, 133, 521, 891, 543, 106, 1, 15, 177, 917, 2118, 2030, 646, 1, 15, 228, 1444, 4424, 6000, 3295, 456, 25, 1, 18, 285, 2207, 8408, 15484, 13106, 4322, 473

Offset: 3

Christopher Hunt Gribble, Feb 28 2014

			The first 5 rows of T(n,k) are:
./ k    0      1      2      3      4      5      6
n
3       1      3      2
4       1      3      4
5       1      6      9
6       1      6     21     13      4
7       1      9     39     53     23
8       1      9     64    128     87
9       1     12     95    283    311     91     10
10      1     12    133    521    891    543    106
11      1     15    177    917   2118   2030    646

Andrew Howroyd, Table of n, a(n) for n = 3..971
Christopher Hunt Gribble, C++ program

Cf. A034851, A226048, A102541, A226290, A238009, A228570, A225812, A238189, A238190, A228572, A228022, A231145, A231473, A231568, A232440, A228165, A238550-A238552, A228166, A238555, A228167, A238557-A238559, A228168, A238581-A238583, A228169, A238586, A238592.

Terms corrected and xrefs updated by Christopher Hunt Gribble, Apr 27 2015

Terms a(48) and beyond by Andrew Howroyd, May 29 2017

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

Original entry on oeis.org

1, 4, 9, 6, 1, 1, 4, 18, 22, 6, 1, 8, 49, 139, 204, 145, 54, 8, 1, 1, 8, 83, 392, 1056, 1438, 956, 240, 25, 1, 12, 139, 927, 3731, 8772, 12069, 9506, 4366, 1160, 179, 16, 1, 1, 12, 198, 1742, 9748, 33644, 73274, 98779, 80661, 37886, 9679, 1258, 72

Offset: 2

Christopher Hunt Gribble, Feb 28 2014

			The first 4 rows of T(n,k) are:
.\ k  0     1     2     3     4     5     6     7     8
n
2     1     4     9     6     1
3     1     4    18    22     6
4     1     8    49   139   204   145    54     8     1
5     1     8    83   392  1056  1438   956   240    25

Andrew Howroyd, Table of n, a(n) for n = 2..991
Christopher Hunt Gribble, C++ program

Cf. A034851, A226048, A102541, A226290, A238009, A228570, A225812, A238189, A238190, A228572, A228022, A231145, A231473, A231568, A232440, A228165, A238550-A238552, A228166, A238555, A238556, A228167, A238558, A238559, A228168, A238581-A238583, A228169, A238586, A238592.

tabf,nonn

Terms corrected and xrefs updated by Christopher Hunt Gribble, Apr 27 2015

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

Original entry on oeis.org

1, 3, 1, 1, 3, 2, 1, 6, 4, 1, 6, 6, 1, 9, 17, 5, 1, 1, 9, 32, 18, 4, 1, 12, 56, 46, 13, 1, 12, 84, 90, 31, 1, 15, 121, 193, 98, 13, 1, 1, 15, 162, 360, 275, 66, 6, 1, 18, 212, 664, 672, 250, 31, 1, 18, 266, 1080, 1408, 672, 110, 1, 21, 329, 1711, 2797, 1772, 432, 23, 1

Offset: 4

Christopher Hunt Gribble, Feb 28 2014

			The first 11 rows of T(n,k) are:
.\  k   0      1      2      3      4     5     6
n
4       1      3      1
5       1      3      2
6       1      6      4
7       1      6      6
8       1      9     17      5      1
9       1      9     32     18      4
10      1     12     56     46     13
11      1     12     84     90     31
12      1     15    121    193     98    13     1
13      1     15    162    360    275    66     6
14      1     18    212    664    672   250    31

Andrew Howroyd, Table of n, a(n) for n = 4..992
Christopher Hunt Gribble, C++ program

Cf. A034851, A226048, A102541, A226290, A238009, A228570, A225812, A238189, A238190, A228572, A228022, A231145, A231473, A231568, A232440, A228165, A238550-A238552, A228166, A238555, A238556, A228167, A238557, A238558, A228168, A238581-A238583, A228169, A238586, A238592.

Terms corrected and xrefs updated by Christopher Hunt Gribble, Apr 27 2015

Terms a(31) and beyond from Andrew Howroyd, May 29 2017

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

Original entry on oeis.org

1, 4, 12, 10, 3, 1, 4, 24, 40, 22, 1, 8, 65, 230, 467, 476, 269, 70, 9, 1, 8, 109, 641, 2281, 4424, 4718, 2409, 473, 1, 12, 182, 1479, 7644, 24024, 47022, 56226, 41000, 17834, 4545, 625, 39, 1, 12, 258, 2762, 19347, 86536, 255552, 495547, 625705, 499314, 239254, 61732, 6533

Offset: 2

Christopher Hunt Gribble, Mar 01 2014

			The first 4 rows of T(n,k) are:
.\ k  0     1     2     3     4     5     6     7     8
n
2     1     4    12    10     3
3     1     4    24    40    22
4     1     8    65   230   467   476   269    70     9
5     1     8   109   641  2281  4424  4718  2409   473

Andrew Howroyd, Table of n, a(n) for n = 2..991
Christopher Hunt Gribble, C++ program

Cf. A034851, A226048, A102541, A226290, A238009, A228570, A225812, A238189, A238190, A228572, A228022, A231145, A231473, A231568, A232440, A228165, A238550-A238552, A228166, A238555, A238556, A228167, A238557-A238559, A228168, A238582, A238583, A228169, A238586, A238592.

Terms corrected and xrefs updated by Christopher Hunt Gribble, Apr 27 2015

Terms a(43) and beyond from Andrew Howroyd, May 29 2017

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

Original entry on oeis.org

1, 3, 2, 1, 3, 4, 1, 6, 9, 1, 6, 14, 1, 9, 32, 18, 4, 1, 9, 55, 65, 23, 1, 12, 91, 164, 87, 1, 12, 132, 320, 229, 1, 15, 186, 608, 648, 134, 10, 1, 15, 245, 1043, 1633, 770, 106, 1, 18, 317, 1736, 3659, 2800, 646, 1, 18, 394, 2666, 7247, 7572, 2510

Offset: 4

Christopher Hunt Gribble, Mar 01 2014

			The first 8 rows of T(n,k) are:
.\ k    0      1      2      3      4
n
4       1      3      2
5       1      3      4
6       1      6      9
7       1      6     14
8       1      9     32     18      4
9       1      9     55     65     23
10      1     12     91    164     87
11      1     12    132    320    229

Andrew Howroyd, Table of n, a(n) for n = 4..992
Christopher Hunt Gribble, C++ program

Cf. A034851, A226048, A102541, A226290, A238009, A228570, A225812, A238189, A238190, A228572, A228022, A231145, A231473, A231568, A232440, A228165, A238550-A238552, A228166, A238555, A238556, A228167, A238557-A238559, A228168, A238581, A238582, A228169, A238586, A238592

Terms corrected and xrefs updated by Christopher Hunt Gribble, Apr 27 2015

Terms a(26) and beyond from Andrew Howroyd, May 29 2017

cp's OEIS Frontend

A238189 Number T(n,k) of equivalence classes of ways of placing k 2 X 2 tiles in an n X 4 rectangle under all symmetry operations of the rectangle; irregular triangle T(n,k), n>=2, 0<=k<=n-n%2, read by rows.

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

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

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

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

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

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

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

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

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

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

Views

Author

Keywords

Examples

Links

Crossrefs

Formula

Extensions

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

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions

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

Views

Author

Keywords

Examples

Links

Crossrefs

Extensions