A128100 - cp's OEIS frontend

A128100 Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)).

n	a(n)
0	1
1	1
2	2
3	1
4	3
5	2
6	5
7	5
8	1
9	8
10	10
11	3
12	13
13	20
14	9
15	1
16	21
17	38
18	22
19	4
20	34
21	71
22	51
23	14
24	1
25	55
26	130
27	111
28	40
29	5
30	89
31	235
32	233
33	105
34	20
35	1
36	144
37	420
38	474
39	256
40	65
41	6
42	233
43	744
44	942
45	594
46	190
47	27
48	1
49	377
50	1308
51	1836
52	1324
53	511
54	98
55	7
56	610
57	2285
58	3522
59	2860
60	1295
61	315
62	35
63	1
64	987
65	3970

[1, 1, 2, 1, 3, 2, 5, 5, 1, 8, 10, 3, 13, 20, 9, 1, 21, 38, 22, 4, 34, 71, 51, 14, 1, 55, 130, 111, 40, 5, 89, 235, 233, 105, 20, 1, 144, 420, 474, 256, 65, 6, 233, 744, 942, 594, 190, 27, 1, 377, 1308, 1836, 1324, 511, 98, 7, 610, 2285, 3522, 2860, 1295, 315, 35, 1, 987, 3970]

cp's OEIS Frontend

A128100 Triangle read by rows: T(n,k) is the number of ways to tile a 2 X n rectangle with k pieces of 2 X 2 tiles and n-2k pieces of 1 X 2 tiles (0 <= k <= floor(n/2)).

Table of values

List of values