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.

A094046 Triangle read by rows: T(n,k) (n>=2; 0<=k<=floor(n/2)-1) is the number of noncrossing connected graphs on n nodes on a circle, having exactly k four-sided faces.

Table of values

n a(n)
2 1
3 4
4 22
5 1
6 141
7 15
8 988
9 171
10 3
11 7337
12 1778
13 77
14 56749
15 17758
16 1300
17 12
18 452332
19 173826
20 18315
21 435
22 3689697
23 1683055
24 233695
25 9680
26 55
27 30652931
28 16195344
29 2804637
30 171226
31 2574
32 258465558
33 155280489
34 32306742
35 2647580
36 70980
37 273

List of values

[1, 4, 22, 1, 141, 15, 988, 171, 3, 7337, 1778, 77, 56749, 17758, 1300, 12, 452332, 173826, 18315, 435, 3689697, 1683055, 233695, 9680, 55, 30652931, 16195344, 2804637, 171226, 2574, 258465558, 155280489, 32306742, 2647580, 70980, 273]