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.

A072248 Triangle T(n,k) (n >= 2, 1 <= k <= n-1) giving number of non-crossing trees with n nodes and height k.

Table of values

n a(n)
2 1
3 1
4 2
5 1
6 7
7 4
8 1
9 20
10 26
11 8
12 1
13 54
14 126
15 76
16 16
17 1
18 143
19 548
20 504
21 200
22 32
23 1
24 376
25 2259
26 2900
27 1656
28 496
29 64
30 1
31 986
32 9034
33 15506
34 11528
35 4896
36 1184
37 128
38 1
39 2583
40 35469
41 79354
42 73172
43 39552
44 13536
45 2752
46 256
47 1
48 6764
49 137644
50 394642
51 439272
52 285992
53 123904
54 35712
55 6272
56 512

List of values

[1, 1, 2, 1, 7, 4, 1, 20, 26, 8, 1, 54, 126, 76, 16, 1, 143, 548, 504, 200, 32, 1, 376, 2259, 2900, 1656, 496, 64, 1, 986, 9034, 15506, 11528, 4896, 1184, 128, 1, 2583, 35469, 79354, 73172, 39552, 13536, 2752, 256, 1, 6764, 137644, 394642, 439272, 285992, 123904, 35712, 6272, 512]