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.

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

Original entry on oeis.org

75, 870, 8760, 90084, 998560, 12043772, 155970678, 2155709610, 31695391776, 494515357842, 8168550752022, 142500961444392, 2619097176333672, 50601139406075592, 1025475335759015016, 21756722754354930024, 482359980950031673440, 11156266866807100122120
Offset: 5

Views

Author

Alois P. Heinz, Oct 17 2018

Keywords

Crossrefs

Column k=5 of A276891.
Cf. A320555.