cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A185287 R(m,n) is the number of ways to split two strings x and y 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 of the y string have at most size 2.

Table of values

n a(n)
1 1
2 1
3 0
4 1
5 1
6 0
7 1
8 2
9 2
10 0
11 1
12 3
13 3
14 0
15 0
16 1
17 4
18 5
19 3
20 0
21 0
22 1
23 5
24 8
25 7
26 3
27 0
28 0
29 1
30 6
31 12
32 13
33 7
34 0
35 0
36 0
37 1
38 7
39 17
40 22
41 16
42 6
43 0
44 0
45 0
46 1
47 8
48 23
49 35
50 32
51 17
52 4
53 0
54 0
55 0
56 1
57 9
58 30
59 53
60 58
61 39
62 14
63 0
64 0
65 0
66 0
67 1
68 10
69 38
70 77
71 98
72 80
73 40
74 10
75 0
76 0

List of values

[1, 1, 0, 1, 1, 0, 1, 2, 2, 0, 1, 3, 3, 0, 0, 1, 4, 5, 3, 0, 0, 1, 5, 8, 7, 3, 0, 0, 1, 6, 12, 13, 7, 0, 0, 0, 1, 7, 17, 22, 16, 6, 0, 0, 0, 1, 8, 23, 35, 32, 17, 4, 0, 0, 0, 1, 9, 30, 53, 58, 39, 14, 0, 0, 0, 0, 1, 10, 38, 77, 98, 80, 40, 10, 0, 0]