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.

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

Original entry on oeis.org

1, 2, 20, 878, 79682, 12043772, 2716968332, 853336081124, 355520118746132, 189580735777428836, 125874638274228457172, 101804159684084842005380, 98514573603328714169588852, 112376135259125932230989633060, 149216698787792363945310009639572
Offset: 0

Views

Author

Alois P. Heinz, Sep 21 2016

Keywords

Crossrefs

Formula

a(n) = A276891(2n,n).