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.

A089435 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 triangles. 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 13
6 8
7 2
8 66
9 60
10 25
11 5
12 367
13 442
14 255
15 84
16 14
17 2164
18 3248
19 2380
20 1064
21 294
22 42
23 13293
24 23904
25 21192
26 11832
27 4410
28 1056
29 132
30 84157
31 176397
32 183303
33 122115
34 56430
35 18216
36 3861
37 429
38 545270
39 1305480
40 1554850
41 1200320
42 657195
43 262262
44 75075

List of values

[1, 3, 1, 13, 8, 2, 66, 60, 25, 5, 367, 442, 255, 84, 14, 2164, 3248, 2380, 1064, 294, 42, 13293, 23904, 21192, 11832, 4410, 1056, 132, 84157, 176397, 183303, 122115, 56430, 18216, 3861, 429, 545270, 1305480, 1554850, 1200320, 657195, 262262, 75075]