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.

A082858 Array A(x,y): the greatest common subtree (intersect) of the binary trees x and y, (x,y) running as (0,0),(1,0),(0,1),(2,0),(1,1),(0,2) and each index referring to a binary tree encoded by A014486(j).

Table of values

n a(n)
0 0
1 0
2 0
3 0
4 1
5 0
6 0
7 1
8 1
9 0
10 0
11 1
12 2
13 1
14 0
15 0
16 1
17 1
18 1
19 1
20 0
21 0
22 1
23 2
24 3
25 2
26 1
27 0
28 0
29 1
30 2
31 1
32 1
33 2
34 1
35 0
36 0
37 1
38 2
39 1
40 4
41 1
42 2
43 1
44 0
45 0
46 1
47 1
48 3
49 2
50 2
51 3
52 1
53 1
54 0
55 0
56 1
57 1
58 3
59 2
60 5
61 2
62 3
63 1
64 1
65 0
66 0
67 1
68 2
69 3
70 1
71 2
72 2
73 1
74 3
75 2
76 1
77 0
78 0
79 1
80 2
81 1
82 1
83 1
84 6
85 1
86 1
87 1
88 2
89 1
90 0
91 0
92 1
93 2
94 1
95 4
96 1
97 3
98 3
99 1
100 4
101 1
102 2
103 1
104 0
105 0
106 1
107 2
108 1
109 4
110 2
111 3
112 7
113 3
114 2
115 4
116 1
117 2
118 1
119 0

List of values

[0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 2, 3, 2, 1, 0, 0, 1, 2, 1, 1, 2, 1, 0, 0, 1, 2, 1, 4, 1, 2, 1, 0, 0, 1, 1, 3, 2, 2, 3, 1, 1, 0, 0, 1, 1, 3, 2, 5, 2, 3, 1, 1, 0, 0, 1, 2, 3, 1, 2, 2, 1, 3, 2, 1, 0, 0, 1, 2, 1, 1, 1, 6, 1, 1, 1, 2, 1, 0, 0, 1, 2, 1, 4, 1, 3, 3, 1, 4, 1, 2, 1, 0, 0, 1, 2, 1, 4, 2, 3, 7, 3, 2, 4, 1, 2, 1, 0]