A308437 - cp's OEIS frontend

A308437 Triangle read by rows: T(n,k) = number of ways, summed over the free n-ominoes, that an n-omino with an assigned orientation can be maximally (partially) covered by k X 1 tiles.

n	a(n)
1	1
2	1
3	1
4	2
5	4
6	1
7	5
8	8
9	4
10	1
11	12
12	35
13	18
14	4
15	1
16	35
17	89
18	61
19	22
20	5
21	1
22	108
23	425
24	206
25	97
26	28
27	5
28	1
29	369
30	1438
31	739
32	436
33	141
34	36
35	6
36	1
37	1285
38	6818
39	3008
40	1853
41	687
42	193
43	44
44	6
45	1
46	4655
47	27713
48	12823
49	7668
50	3233
51	1039
52	268
53	54
54	7
55	1
56	17073
57	125830
58	51619
59	30902
60	14731
61	5164
62	1518
63	351
64	64
65	7
66	1

[1, 1, 1, 2, 4, 1, 5, 8, 4, 1, 12, 35, 18, 4, 1, 35, 89, 61, 22, 5, 1, 108, 425, 206, 97, 28, 5, 1, 369, 1438, 739, 436, 141, 36, 6, 1, 1285, 6818, 3008, 1853, 687, 193, 44, 6, 1, 4655, 27713, 12823, 7668, 3233, 1039, 268, 54, 7, 1, 17073, 125830, 51619, 30902, 14731, 5164, 1518, 351, 64, 7, 1]

cp's OEIS Frontend

A308437 Triangle read by rows: T(n,k) = number of ways, summed over the free n-ominoes, that an n-omino with an assigned orientation can be maximally (partially) covered by k X 1 tiles.

Table of values

List of values