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!)
A271739 Number of set partitions of [n] with maximal block length multiplicity equal to ten. 2

%I #8 May 08 2018 06:23:43

%S 1,0,66,286,4004,33033,328328,3150576,31286970,316394650,3928974907,

%T 48404715723,526502083107,6475762500130,88834932638892,

%U 1136875206056150,14448572171583550,197345257083676845,2738327374576989195,37603158111513714720,528367079280330690400

%N Number of set partitions of [n] with maximal block length multiplicity equal to ten.

%C At least one block length occurs exactly 10 times, and all block lengths occur at most 10 times.

%H Alois P. Heinz, <a href="/A271739/b271739.txt">Table of n, a(n) for n = 10..584</a>

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>

%p with(combinat):

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

%p `if`(i<1, 0, add(multinomial(n, n-i*j, i$j)

%p *b(n-i*j, i-1, k)/j!, j=0..min(k, n/i))))

%p end:

%p a:= n-> b(n$2, 10)-b(n$2, 9):

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

%t multinomial[n_, k_List] := n!/Times @@ (k!);

%t b[n_, i_, k_] := b[n, i, k] = If[n == 0, 1, If[i < 1, 0, Sum[multinomial[n, Join[{n - i*j}, Table[i, j]]]*b[n - i*j, i - 1, k]/j!, {j, 0, Min[k, n/i] }]]];

%t a[n_] := b[n, n, 10] - b[n, n, 9];

%t Table[a[n], {n, 10, 30}] (* _Jean-François Alcover_, May 08 2018, after _Alois P. Heinz_ *)

%Y Column k=10 of A271423.

%K nonn

%O 10,3

%A _Alois P. Heinz_, Apr 13 2016

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 16 11:08 EDT 2024. Contains 371711 sequences. (Running on oeis4.)