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.

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

Table of values

n a(n)
0 1
1 1
2 2
3 2
4 4
5 16
6 40
7 80
8 80
9 8
10 64
11 400
12 2240
13 11360
14 55040
15 253440
16 1056000
17 3801600
18 10982400
19 21964800
20 21964800
21 16
22 208
23 2048
24 18816
25 168768
26 1508032
27 13501312
28 121362560
29 1099169280
30 10049994240
31 92644597760
32 857213660160
33 7907423180800
34 72155129446400

List of values

[1, 1, 2, 2, 4, 16, 40, 80, 80, 8, 64, 400, 2240, 11360, 55040, 253440, 1056000, 3801600, 10982400, 21964800, 21964800, 16, 208, 2048, 18816, 168768, 1508032, 13501312, 121362560, 1099169280, 10049994240, 92644597760, 857213660160, 7907423180800, 72155129446400]