A128101 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	1
3	3
4	1
5	1
6	6
7	4
8	1
9	9
10	16
11	8
12	1
13	1
14	12
15	37
16	34
17	9
18	1
19	15
20	67
21	105
22	65
23	15
24	1
25	1
26	18
27	106
28	248
29	250
30	108
31	16
32	1
33	21
34	154
35	490
36	726
37	522
38	176
39	24
40	1
41	1
42	24
43	211
44	858
45	1736
46	1824
47	994
48	260
49	25
50	1
51	27
52	277
53	1379
54	3604
55	5148
56	4090
57	1770
58	385
59	35
60	1
61	1
62	30
63	352
64	2080

[1, 1, 1, 3, 1, 1, 6, 4, 1, 9, 16, 8, 1, 1, 12, 37, 34, 9, 1, 15, 67, 105, 65, 15, 1, 1, 18, 106, 248, 250, 108, 16, 1, 21, 154, 490, 726, 522, 176, 24, 1, 1, 24, 211, 858, 1736, 1824, 994, 260, 25, 1, 27, 277, 1379, 3604, 5148, 4090, 1770, 385, 35, 1, 1, 30, 352, 2080]

cp's OEIS Frontend

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

Table of values

List of values