A191588 - cp's OEIS frontend

A191588 T(m,n) is the number of ways to split two strings of length m and n, respectively, into the same number of nonempty parts such that at least one of the corresponding parts has length 1 and such that the parts have at most size 2.

n	a(n)
1	1
2	1
3	1
4	0
5	2
6	3
7	0
8	1
9	3
10	7
11	0
12	0
13	3
14	7
15	13
16	0
17	0
18	1
19	6
20	17
21	27
22	0
23	0
24	0
25	4
26	14
27	36
28	61
29	0
30	0
31	0
32	1
33	10
34	35
35	77
36	133
37	0
38	0
39	0
40	0
41	5
42	25
43	81
44	173
45	287
46	0
47	0
48	0
49	0
50	1
51	15
52	65
53	183
54	387
55	633
56	0
57	0
58	0
59	0
60	0
61	6
62	41
63	161
64	421
65	857
66	1407
67	0
68	0
69	0
70	0
71	0
72	1
73	21
74	112
75	385
76	969
77	1911
78	3121
79	0
80	0
81	0
82	0
83	0
84	0
85	7
86	63
87	294
88	918
89	2211
90	4287
91	6943
92	0
93	0
94	0
95	0
96	0
97	0
98	1
99	28
100	182
101	742
102	2181
103	5040
104	9619
105	15517
106	0
107	0

[1, 1, 1, 0, 2, 3, 0, 1, 3, 7, 0, 0, 3, 7, 13, 0, 0, 1, 6, 17, 27, 0, 0, 0, 4, 14, 36, 61, 0, 0, 0, 1, 10, 35, 77, 133, 0, 0, 0, 0, 5, 25, 81, 173, 287, 0, 0, 0, 0, 1, 15, 65, 183, 387, 633, 0, 0, 0, 0, 0, 6, 41, 161, 421, 857, 1407, 0, 0, 0, 0, 0, 1, 21, 112, 385, 969, 1911, 3121, 0, 0, 0, 0, 0, 0, 7, 63, 294, 918, 2211, 4287, 6943, 0, 0, 0, 0, 0, 0, 1, 28, 182, 742, 2181, 5040, 9619, 15517, 0, 0]

cp's OEIS Frontend

A191588 T(m,n) is the number of ways to split two strings of length m and n, respectively, into the same number of nonempty parts such that at least one of the corresponding parts has length 1 and such that the parts have at most size 2.

Table of values

List of values