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.

A276728 Number of set partitions of [2n] where k=n is minimal such that for each block b the smallest integer interval containing b has at most k elements.

Table of values

n a(n)
0 1
1 1
2 4
3 29
4 336
5 5375
6 111138
7 2845864
8 87597223
9 3170429794
10 132647186513
11 6328769607152
12 340517379645028
13 20469645334387763
14 1363935094328964210
15 100052662656438620359
16 8032243625863280744704

List of values

[1, 1, 4, 29, 336, 5375, 111138, 2845864, 87597223, 3170429794, 132647186513, 6328769607152, 340517379645028, 20469645334387763, 1363935094328964210, 100052662656438620359, 8032243625863280744704]