A307689 - cp's OEIS frontend

A307689 The number of rooted binary trees on n leaves with minimal Colless index.

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	2
7	1
8	1
9	1
10	3
11	3
12	4
13	3
14	3
15	1
16	1
17	1
18	4
19	6
20	10
21	16
22	21
23	13
24	11
25	13
26	21
27	16
28	10
29	6
30	4
31	1
32	1
33	1
34	5
35	10
36	20
37	50
38	82
39	73
40	66
41	184
42	411
43	548
44	351
45	455
46	326
47	144
48	67
49	144
50	326
51	455
52	351
53	548
54	411
55	184
56	66
57	73
58	82
59	50
60	20
61	10
62	5
63	1
64	1

[1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 4, 3, 3, 1, 1, 1, 4, 6, 10, 16, 21, 13, 11, 13, 21, 16, 10, 6, 4, 1, 1, 1, 5, 10, 20, 50, 82, 73, 66, 184, 411, 548, 351, 455, 326, 144, 67, 144, 326, 455, 351, 548, 411, 184, 66, 73, 82, 50, 20, 10, 5, 1, 1]

cp's OEIS Frontend

A307689 The number of rooted binary trees on n leaves with minimal Colless index.

Table of values

List of values

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	2
7	1
8	1
9	1
10	3
11	3
12	4
13	3
14	3
15	1
16	1
17	1
18	4
19	6
20	10
21	16
22	21
23	13
24	11
25	13
26	21
27	16
28	10
29	6
30	4
31	1
32	1
33	1
34	5
35	10
36	20
37	50
38	82
39	73
40	66
41	184
42	411
43	548
44	351
45	455
46	326
47	144
48	67
49	144
50	326
51	455
52	351
53	548
54	411
55	184
56	66
57	73
58	82
59	50
60	20
61	10
62	5
63	1
64	1

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	2
7	1
8	1
9	1
10	3
11	3
12	4
13	3
14	3
15	1
16	1
17	1
18	4
19	6
20	10
21	16
22	21
23	13
24	11
25	13
26	21
27	16
28	10
29	6
30	4
31	1
32	1
33	1
34	5
35	10
36	20
37	50
38	82
39	73
40	66
41	184
42	411
43	548
44	351
45	455
46	326
47	144
48	67
49	144
50	326
51	455
52	351
53	548
54	411
55	184
56	66
57	73
58	82
59	50
60	20
61	10
62	5
63	1
64	1

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	2
7	1
8	1
9	1
10	3
11	3
12	4
13	3
14	3
15	1
16	1
17	1
18	4
19	6
20	10
21	16
22	21
23	13
24	11
25	13
26	21
27	16
28	10
29	6
30	4
31	1
32	1
33	1
34	5
35	10
36	20
37	50
38	82
39	73
40	66
41	184
42	411
43	548
44	351
45	455
46	326
47	144
48	67
49	144
50	326
51	455
52	351
53	548
54	411
55	184
56	66
57	73
58	82
59	50
60	20
61	10
62	5
63	1
64	1