A193376 - cp's OEIS frontend

A193376 T(n,k) = number of ways to place any number of 2 X 1 tiles of k distinguishable colors into an n X 1 grid; array read by descending antidiagonals, with n, k >= 1.

n	a(n)
1	1
2	1
3	2
4	1
5	3
6	3
7	1
8	4
9	5
10	5
11	1
12	5
13	7
14	11
15	8
16	1
17	6
18	9
19	19
20	21
21	13
22	1
23	7
24	11
25	29
26	40
27	43
28	21
29	1
30	8
31	13
32	41
33	65
34	97
35	85
36	34
37	1
38	9
39	15
40	55
41	96
42	181
43	217
44	171
45	55
46	1
47	10
48	17
49	71
50	133
51	301
52	441
53	508
54	341
55	89
56	1
57	11
58	19
59	89
60	176
61	463
62	781
63	1165
64	1159
65	683
66	144
67	1
68	12
69	21
70	109
71	225
72	673

[1, 1, 2, 1, 3, 3, 1, 4, 5, 5, 1, 5, 7, 11, 8, 1, 6, 9, 19, 21, 13, 1, 7, 11, 29, 40, 43, 21, 1, 8, 13, 41, 65, 97, 85, 34, 1, 9, 15, 55, 96, 181, 217, 171, 55, 1, 10, 17, 71, 133, 301, 441, 508, 341, 89, 1, 11, 19, 89, 176, 463, 781, 1165, 1159, 683, 144, 1, 12, 21, 109, 225, 673]

cp's OEIS Frontend

A193376 T(n,k) = number of ways to place any number of 2 X 1 tiles of k distinguishable colors into an n X 1 grid; array read by descending antidiagonals, with n, k >= 1.

Table of values

List of values