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.

A373760 Number of noncrossing partitions of the n-set including a part containing both 1 and n (with n different from 1), with no pair of singletons {i} and {j} that can be merged into {i,j} and leave the partition a noncrossing partition.

Table of values

n a(n)
0 0
1 0
2 1
3 2
4 4
5 11
6 30
7 88
8 266
9 825
10 2613
11 8408
12 27421
13 90422
14 300987
15 1010008
16 3413027
17 11604237
18 39668334
19 136258178
20 470060495
21 1627913941
22 5657649569
23 19725571728
24 68975054956
25 241834515725
26 849993720642
27 2994348927858
28 10570741932441
29 37390372928207
30 132497284947463

List of values

[0, 0, 1, 2, 4, 11, 30, 88, 266, 825, 2613, 8408, 27421, 90422, 300987, 1010008, 3413027, 11604237, 39668334, 136258178, 470060495, 1627913941, 5657649569, 19725571728, 68975054956, 241834515725, 849993720642, 2994348927858, 10570741932441, 37390372928207, 132497284947463]