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.

A094021 Triangle read by rows: T(n,k) is the number of noncrossing forests with n vertices and k components (1<=k<=n).

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 3
6 1
7 12
8 14
9 6
10 1
11 55
12 75
13 40
14 10
15 1
16 273
17 429
18 275
19 90
20 15
21 1
22 1428
23 2548
24 1911
25 770
26 175
27 21
28 1
29 7752
30 15504
31 13328
32 6370
33 1820
34 308
35 28
36 1
37 43263
38 95931
39 93024
40 51408
41 17640
42 3822
43 504
44 36
45 1
46 246675
47 600875
48 648945
49 406980
50 162792
51 42840

List of values

[1, 1, 1, 3, 3, 1, 12, 14, 6, 1, 55, 75, 40, 10, 1, 273, 429, 275, 90, 15, 1, 1428, 2548, 1911, 770, 175, 21, 1, 7752, 15504, 13328, 6370, 1820, 308, 28, 1, 43263, 95931, 93024, 51408, 17640, 3822, 504, 36, 1, 246675, 600875, 648945, 406980, 162792, 42840]