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.

A363448 Number of noncrossing partitions of the n-set 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 1
1 1
2 1
3 4
4 9
5 26
6 77
7 232
8 725
9 2299
10 7415
11 24223
12 79983
13 266553
14 895333
15 3028093
16 10303085
17 35243330
18 121128329
19 418080561
20 1448564695
21 5036434577
22 17566314287
23 61445833012
24 215503978367
25 757666696926
26 2669811026147
27 9427368738487
28 33353695100085
29 118217920021287

List of values

[1, 1, 1, 4, 9, 26, 77, 232, 725, 2299, 7415, 24223, 79983, 266553, 895333, 3028093, 10303085, 35243330, 121128329, 418080561, 1448564695, 5036434577, 17566314287, 61445833012, 215503978367, 757666696926, 2669811026147, 9427368738487, 33353695100085, 118217920021287]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.