A335919 - cp's OEIS frontend

A335919 Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), n>=0, max(0,floor(log_2(n))+1)<=k<=n, read by rows.

n	a(n)
0	1
1	1
2	2
3	1
4	4
5	6
6	8
7	6
8	20
9	16
10	4
11	40
12	56
13	32
14	1
15	68
16	152
17	144
18	64
19	94
20	376
21	480
22	352
23	128
24	114
25	844
26	1440
27	1376
28	832
29	256
30	116
31	1744
32	4056
33	4736
34	3712
35	1920
36	512
37	94
38	3340
39	10856
40	15248
41	14272
42	9600
43	4352
44	1024
45	60
46	5976
47	27672
48	47104
49	50784
50	40576
51	24064

[1, 1, 2, 1, 4, 6, 8, 6, 20, 16, 4, 40, 56, 32, 1, 68, 152, 144, 64, 94, 376, 480, 352, 128, 114, 844, 1440, 1376, 832, 256, 116, 1744, 4056, 4736, 3712, 1920, 512, 94, 3340, 10856, 15248, 14272, 9600, 4352, 1024, 60, 5976, 27672, 47104, 50784, 40576, 24064]

cp's OEIS Frontend

A335919 Number T(n,k) of binary search trees of height k having n internal nodes; triangle T(n,k), n>=0, max(0,floor(log_2(n))+1)<=k<=n, read by rows.

Table of values

List of values