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.

A276900 Number of ordered set partitions of [n] such that for each block b the smallest integer interval containing b has at most ten elements.

Original entry on oeis.org

1, 1, 3, 13, 75, 541, 4683, 47293, 545835, 7087261, 102247563, 1520385010, 23523325304, 380789137336, 6467270373536, 115360990236256, 2161133759447744, 42490485277902688, 875847933546165968, 18903517993567133752, 426618313415065361204, 10043227358229156346032
Offset: 0

Views

Author

Alois P. Heinz, Sep 21 2016

Keywords

Crossrefs

Column k=10 of A276890.
Cf. A276726.

Formula

a(n) ~ exp(9) * n!. - Vaclav Kotesovec, Sep 22 2016