A195581 - cp's OEIS frontend

A195581 Number T(n,k) of permutations of {1,2,...,n} that result in a binary search tree of height k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

n	a(n)
0	1
1	0
2	1
3	0
4	0
5	2
6	0
7	0
8	2
9	4
10	0
11	0
12	0
13	16
14	8
15	0
16	0
17	0
18	40
19	64
20	16
21	0
22	0
23	0
24	80
25	400
26	208
27	32
28	0
29	0
30	0
31	80
32	2240
33	2048
34	608
35	64
36	0
37	0
38	0
39	0
40	11360
41	18816
42	8352
43	1664
44	128
45	0
46	0
47	0
48	0
49	55040
50	168768
51	104448
52	30016
53	4352
54	256
55	0
56	0
57	0
58	0
59	253440
60	1508032
61	1277568
62	479040
63	99200
64	11008
65	512

[1, 0, 1, 0, 0, 2, 0, 0, 2, 4, 0, 0, 0, 16, 8, 0, 0, 0, 40, 64, 16, 0, 0, 0, 80, 400, 208, 32, 0, 0, 0, 80, 2240, 2048, 608, 64, 0, 0, 0, 0, 11360, 18816, 8352, 1664, 128, 0, 0, 0, 0, 55040, 168768, 104448, 30016, 4352, 256, 0, 0, 0, 0, 253440, 1508032, 1277568, 479040, 99200, 11008, 512]

cp's OEIS Frontend

A195581 Number T(n,k) of permutations of {1,2,...,n} that result in a binary search tree of height k; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Table of values

List of values