A128099 - cp's OEIS frontend

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

n	a(n)
0	1
1	1
2	1
3	2
4	1
5	4
6	1
7	6
8	4
9	1
10	8
11	12
12	1
13	10
14	24
15	8
16	1
17	12
18	40
19	32
20	1
21	14
22	60
23	80
24	16
25	1
26	16
27	84
28	160
29	80
30	1
31	18
32	112
33	280
34	240
35	32
36	1
37	20
38	144
39	448
40	560
41	192
42	1
43	22
44	180
45	672
46	1120
47	672
48	64
49	1
50	24
51	220
52	960
53	2016
54	1792
55	448
56	1
57	26
58	264
59	1320
60	3360
61	4032
62	1792
63	128
64	1
65	28

[1, 1, 1, 2, 1, 4, 1, 6, 4, 1, 8, 12, 1, 10, 24, 8, 1, 12, 40, 32, 1, 14, 60, 80, 16, 1, 16, 84, 160, 80, 1, 18, 112, 280, 240, 32, 1, 20, 144, 448, 560, 192, 1, 22, 180, 672, 1120, 672, 64, 1, 24, 220, 960, 2016, 1792, 448, 1, 26, 264, 1320, 3360, 4032, 1792, 128, 1, 28]

cp's OEIS Frontend

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

Table of values

List of values