A334056 - cp's OEIS frontend

A334056 Triangle read by rows: T(n,k) is the number of configurations with exactly k polyomino matchings in a generalized game of memory played on the path of length 3n.

n	a(n)
0	1
1	0
2	1
3	7
4	2
5	1
6	219
7	53
8	7
9	1
10	12861
11	2296
12	226
13	16
14	1
15	1215794
16	171785
17	13080
18	710
19	30
20	1
21	169509845
22	19796274
23	1228655
24	53740
25	1835
26	50
27	1
28	32774737463
29	3260279603
30	170725639
31	6250755
32	178325
33	4137
34	77
35	1
36	8400108766161
37	727564783392
38	32944247308
39	1036855344
40	25359670
41	507584
42	8428
43	112
44	1

[1, 0, 1, 7, 2, 1, 219, 53, 7, 1, 12861, 2296, 226, 16, 1, 1215794, 171785, 13080, 710, 30, 1, 169509845, 19796274, 1228655, 53740, 1835, 50, 1, 32774737463, 3260279603, 170725639, 6250755, 178325, 4137, 77, 1, 8400108766161, 727564783392, 32944247308, 1036855344, 25359670, 507584, 8428, 112, 1]

cp's OEIS Frontend

A334056 Triangle read by rows: T(n,k) is the number of configurations with exactly k polyomino matchings in a generalized game of memory played on the path of length 3n.

Table of values

List of values