A334059 - cp's OEIS frontend

A334059 Triangle read by rows: T(n,k) is the number of perfect matchings on {1, 2, ..., 2n} with k disjoint strings of adjacent short pairs.

n	a(n)
0	1
1	0
2	1
3	1
4	2
5	0
6	5
7	8
8	2
9	0
10	36
11	49
12	19
13	1
14	0
15	329
16	414
17	180
18	22
19	0
20	0
21	3655
22	4398
23	1986
24	344
25	12
26	0
27	0
28	47844
29	55897
30	25722
31	5292
32	377
33	3
34	0
35	0
36	721315
37	825056
38	384366
39	87296
40	8746
41	246
42	0
43	0
44	0
45	12310199
46	13856570
47	6513530
48	1577350
49	192250
50	9436
51	90
52	0
53	0
54	0

[1, 0, 1, 1, 2, 0, 5, 8, 2, 0, 36, 49, 19, 1, 0, 329, 414, 180, 22, 0, 0, 3655, 4398, 1986, 344, 12, 0, 0, 47844, 55897, 25722, 5292, 377, 3, 0, 0, 721315, 825056, 384366, 87296, 8746, 246, 0, 0, 0, 12310199, 13856570, 6513530, 1577350, 192250, 9436, 90, 0, 0, 0]

cp's OEIS Frontend

A334059 Triangle read by rows: T(n,k) is the number of perfect matchings on {1, 2, ..., 2n} with k disjoint strings of adjacent short pairs.

Table of values

List of values