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.

A089434 Triangle read by rows: T(n,k) (n >= 2, k >= 0) is the number of non-crossing connected graphs on n nodes on a circle, having k interior faces. Rows are indexed 2,3,4,...; columns are indexed 0,1,2,....

Table of values

n a(n)
2 1
3 3
4 1
5 12
6 9
7 2
8 55
9 66
10 30
11 5
12 273
13 455
14 315
15 105
16 14
17 1428
18 3060
19 2856
20 1428
21 378
22 42
23 7752
24 20349
25 23940
26 15960
27 6300
28 1386
29 132
30 43263
31 134596
32 191268
33 159390
34 83490
35 27324
36 5148
37 429
38 246675
39 888030
40 1480050
41 1480050
42 965250
43 418275
44 117117

List of values

[1, 3, 1, 12, 9, 2, 55, 66, 30, 5, 273, 455, 315, 105, 14, 1428, 3060, 2856, 1428, 378, 42, 7752, 20349, 23940, 15960, 6300, 1386, 132, 43263, 134596, 191268, 159390, 83490, 27324, 5148, 429, 246675, 888030, 1480050, 1480050, 965250, 418275, 117117]