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.

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

Original entry on oeis.org

7087261, 183779178, 3762089520, 72416697816, 1384785261888, 26933164023936, 538943434056240, 11161053068862792, 239918736073504524, 5377267055166042184, 125874638274228457172, 3067862283177425632176, 77667019131362612168256, 2038671040407878313592224
Offset: 10

Views

Author

Alois P. Heinz, Oct 17 2018

Keywords

Crossrefs

Column k=10 of A276891.
Cf. A320560.