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!)
A320762 Number of ordered set partitions of [n] where the maximal block size equals six. 2

%I #4 Oct 20 2018 17:53:30

%S 1,14,224,3696,64680,1206744,24011988,508864356,11459682234,

%T 273563089800,6904861371408,183819838041840,5149305370473264,

%U 151447801937560128,4666989813249123360,150394712706368466336,5059062167993588722968,177346570951333803395376

%N Number of ordered set partitions of [n] where the maximal block size equals six.

%H Alois P. Heinz, <a href="/A320762/b320762.txt">Table of n, a(n) for n = 6..424</a>

%F E.g.f.: 1/(1-Sum_{i=1..6} x^i/i!) - 1/(1-Sum_{i=1..5} x^i/i!).

%F a(n) = A276926(n) - A276925(n).

%p b:= proc(n, k) option remember; `if`(n=0, 1, add(

%p b(n-i, k)*binomial(n, i), i=1..min(n, k)))

%p end:

%p a:= n-> (k-> b(n, k) -b(n, k-1))(6):

%p seq(a(n), n=6..25);

%Y Column k=6 of A276922.

%Y Cf. A276925, A276926.

%K nonn

%O 6,2

%A _Alois P. Heinz_, Oct 20 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 August 19 20:56 EDT 2024. Contains 375310 sequences. (Running on oeis4.)