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.

Original entry on oeis.org

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

Views

Author

Alois P. Heinz, Oct 17 2018

Keywords

Crossrefs

Column k=3 of A276891.
Cf. A320553.