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.

A320616 Number of ordered set partitions of [n] where k = three 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)
3 3
4 18
5 118
6 878
7 7224
8 65514
9 652446
10 7092672
11 83679936
12 1065839544
13 14586155400
14 213544496760
15 3331500035160
16 55190744651520
17 967799429431920
18 17911992891306240
19 348981340420308960
20 7140367412382592080
21 153090240159322655280
22 3432492956469166894080

List of values

[3, 18, 118, 878, 7224, 65514, 652446, 7092672, 83679936, 1065839544, 14586155400, 213544496760, 3331500035160, 55190744651520, 967799429431920, 17911992891306240, 348981340420308960, 7140367412382592080, 153090240159322655280, 3432492956469166894080]