A180091 - cp's OEIS frontend

A180091 a(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.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	3
7	1
8	3
9	5
10	9
11	1
12	4
13	8
14	15
15	27
16	1
17	5
18	12
19	24
20	46
21	83
22	1
23	6
24	17
25	37
26	75
27	143
28	259
29	1
30	7
31	23
32	55
33	118
34	237
35	450
36	817
37	1
38	8
39	30
40	79
41	180
42	380
43	755
44	1429
45	2599
46	1
47	9
48	38
49	110
50	267
51	592
52	1229
53	2421
54	4570
55	8323

[1, 1, 1, 1, 2, 3, 1, 3, 5, 9, 1, 4, 8, 15, 27, 1, 5, 12, 24, 46, 83, 1, 6, 17, 37, 75, 143, 259, 1, 7, 23, 55, 118, 237, 450, 817, 1, 8, 30, 79, 180, 380, 755, 1429, 2599, 1, 9, 38, 110, 267, 592, 1229, 2421, 4570, 8323]

cp's OEIS Frontend

A180091 a(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.

Table of values

List of values