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.

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

Original entry on oeis.org

13, 114, 924, 8152, 79682, 845874, 9699504, 119751978, 1586912838, 22489462512, 339643322952, 5448229269576, 92547041455104, 1660105401121800, 31366215961317480, 622755664408102200, 12964583019385962840, 282431877654287832480, 6426548730391132252800
Offset: 4

Views

Author

Alois P. Heinz, Oct 17 2018

Keywords

Crossrefs

Column k=4 of A276891.
Cf. A320554.