The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A320615 Number of ordered set partitions of [n] where k = two is minimal such that for each block b the smallest integer interval containing b has at most k elements. 2
 1, 4, 20, 114, 750, 5616, 47304, 443400, 4582200, 51790320, 635791680, 8426915280, 119960552880, 1825701857280, 29585590473600, 508653914267520, 9248148480574080, 177303557272262400, 3574966680853747200, 75628468328518828800, 1675003757666567328000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,2 LINKS Alois P. Heinz, Table of n, a(n) for n = 2..450 CROSSREFS Column k=2 of A276891. Sequence in context: A346414 A028475 A128327 * A316298 A291531 A171802 Adjacent sequences:  A320612 A320613 A320614 * A320616 A320617 A320618 KEYWORD nonn AUTHOR Alois P. Heinz, Oct 17 2018 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 26 09:50 EST 2022. Contains 358354 sequences. (Running on oeis4.)