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.

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

Original entry on oeis.org

47293, 954474, 15508464, 241671288, 3808957488, 62028248808, 1053594440748, 18837315620872, 355520118746132, 7047222477079248, 146217215537789592, 3167613534709242360, 71513228693083286190, 1679867307590816179554, 41004496962535457286432
Offset: 8

Views

Author

Alois P. Heinz, Oct 17 2018

Keywords

Crossrefs

Column k=8 of A276891.
Cf. A320558.