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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A320620 Number of ordered set partitions of [n] where k = seven is minimal such that for each block b the smallest integer interval containing b has at most k elements. 3

%I #4 Oct 17 2018 17:29:59

%S 4683,81078,1148016,15821592,223324968,3291487548,51390688648,

%T 853336081124,14968971308424,276240216296568,5347594452033174,

%U 108358364062922106,2294379672012591648,50691426196004660946,1167051922550186976006,27960460507841919880920

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

%H Alois P. Heinz, <a href="/A320620/b320620.txt">Table of n, a(n) for n = 7..450</a>

%Y Column k=7 of A276891.

%Y Cf. A320557.

%K nonn

%O 7,1

%A _Alois P. Heinz_, Oct 17 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:13 EDT 2024. Contains 371265 sequences. (Running on oeis4.)