A335920 - cp's OEIS frontend

A335920 Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), k>=0, k<=n<=2^k-1, read by columns.

n	a(n)
0	1
1	1
2	2
3	1
4	4
5	6
6	6
7	4
8	1
9	8
10	20
11	40
12	68
13	94
14	114
15	116
16	94
17	60
18	28
19	8
20	1
21	16
22	56
23	152
24	376
25	844
26	1744
27	3340
28	5976
29	10040
30	15856
31	23460
32	32398
33	41658
34	49700
35	54746
36	55308
37	50788
38	41944
39	30782
40	19788
41	10948
42	5096
43	1932
44	568
45	120
46	16
47	1
48	32
49	144
50	480
51	1440
52	4056

[1, 1, 2, 1, 4, 6, 6, 4, 1, 8, 20, 40, 68, 94, 114, 116, 94, 60, 28, 8, 1, 16, 56, 152, 376, 844, 1744, 3340, 5976, 10040, 15856, 23460, 32398, 41658, 49700, 54746, 55308, 50788, 41944, 30782, 19788, 10948, 5096, 1932, 568, 120, 16, 1, 32, 144, 480, 1440, 4056]

cp's OEIS Frontend

A335920 Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), k>=0, k<=n<=2^k-1, read by columns.

Table of values

List of values