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.

A358397 Number of pairs of partitions (A<=B, that is, A is a refinement of B) of [n] such that A is noncrossing and its nontrivial blocks are of type {a,b} with a <= n and b > n.

Table of values

n a(n)
0 1
1 1
2 3
3 9
4 37
5 157
6 811
7 4309
8 26327
9 164947
10 1151477
11 8224863
12 64158567
13 511177515
14 4386520201
15 38389960685
16 358214414675
17 3404632390971
18 34234771676473
19 350261221644771
20 3768281045014927
21 41210302324325919
22 471585931164213345
23 5480984322433817771
24 66388136273738685321

List of values

[1, 1, 3, 9, 37, 157, 811, 4309, 26327, 164947, 1151477, 8224863, 64158567, 511177515, 4386520201, 38389960685, 358214414675, 3404632390971, 34234771676473, 350261221644771, 3768281045014927, 41210302324325919, 471585931164213345, 5480984322433817771, 66388136273738685321]

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

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