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.

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

Original entry on oeis.org

541, 7818, 94560, 1135776, 14198988, 189532744, 2716968332, 41443110120, 669224125374, 11402985454002, 204553341234144, 3855820648785642, 76243011649519518, 1578630066678711432, 34166379193222751952, 771672681929886240912, 18159430155134639111112
Offset: 6

Views

Author

Alois P. Heinz, Oct 17 2018

Keywords

Crossrefs

Column k=6 of A276891.
Cf. A320556.