A362142 - cp's OEIS frontend

A362142 Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, 0 <= k <= n.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	2
9	4
10	1
11	1
12	3
13	6
14	16
15	1
16	1
17	4
18	12
19	37
20	140
21	1
22	1
23	6
24	24
25	105
26	454
27	1987
28	1
29	1
30	10
31	40
32	250
33	1566
34	9856
35	62266
36	1
37	1
38	15
39	80
40	726
41	5670
42	47394
43	406168
44	3899340
45	1
46	1
47	21
48	160
49	1824
50	18738
51	223696
52	2916492
53	38322758
54	508317004

[1, 1, 1, 1, 1, 1, 1, 1, 2, 4, 1, 1, 3, 6, 16, 1, 1, 4, 12, 37, 140, 1, 1, 6, 24, 105, 454, 1987, 1, 1, 10, 40, 250, 1566, 9856, 62266, 1, 1, 15, 80, 726, 5670, 47394, 406168, 3899340, 1, 1, 21, 160, 1824, 18738, 223696, 2916492, 38322758, 508317004]

cp's OEIS Frontend

A362142 Triangle read by rows: T(n,k) is the maximum number of ways in which a set of integer-sided squares can tile an n X k rectangle, 0 <= k <= n.

Table of values

List of values