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.

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

Original entry on oeis.org

545835, 12584310, 230967120, 4020567144, 70085446176, 1251488442768, 23136897546984, 445129521202044, 8967451281890920, 189580735777428836, 4189466666732025552, 96503099183372332800, 2312171653716970887384, 57525923379398601317976, 1484102063758068278022054
Offset: 9

Views

Author

Alois P. Heinz, Oct 17 2018

Keywords

Crossrefs

Column k=9 of A276891.
Cf. A320559.