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

%I #4 Oct 20 2018 18:08:27

%S 1,22,528,12584,308308,7843836,208111904,5767576672,167004507384,

%T 5050066185736,159340977018652,5240336900883084,179428070995076904,

%U 6388579669849124748,236257342145458744968,9064169856705631376280,360365153529146965326270

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

%H Alois P. Heinz, <a href="/A320766/b320766.txt">Table of n, a(n) for n = 10..426</a>

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

%F a(n) = A276930(n) - A276929(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))(10):

%p seq(a(n), n=10..30);

%Y Column k=10 of A276922.

%Y Cf. A276929, A276930.

%K nonn

%O 10,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 April 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)