A362258 - cp's OEIS frontend

A362258 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, up to rotations and reflections, 0 <= k <= n.

n	a(n)
0	1
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	1
9	1
10	1
11	1
12	2
13	2
14	4
15	1
16	1
17	2
18	4
19	13
20	20
21	1
22	1
23	4
24	8
25	33
26	125
27	277
28	1
29	1
30	6
31	12
32	72
33	403
34	2505
35	7855
36	1
37	1
38	9
39	22
40	204
41	1438
42	12069
43	101587
44	487662

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 4, 1, 1, 2, 4, 13, 20, 1, 1, 4, 8, 33, 125, 277, 1, 1, 6, 12, 72, 403, 2505, 7855, 1, 1, 9, 22, 204, 1438, 12069, 101587, 487662]

cp's OEIS Frontend

A362258 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, up to rotations and reflections, 0 <= k <= n.

Table of values

List of values