cp's OEIS Frontend

A271735 Number of set partitions of [n] with maximal block length multiplicity equal to six.

%I A271735 #8 May 08 2018 06:22:54
%S A271735 1,0,28,84,840,5082,48279,413127,3093090,26601575,255431176,
%T A271735 2309491548,20998179748,209051155600,2137087555220,21652990622410,
%U A271735 230200208290745,2517313465793819,28104615964752327,320432370881428575,3760667223506993800,45094960570293757695
%N A271735 Number of set partitions of [n] with maximal block length multiplicity equal to six.
%C A271735 At least one block length occurs exactly 6 times, and all block lengths occur at most 6 times.
%H A271735 Alois P. Heinz, <a href="/A271735/b271735.txt">Table of n, a(n) for n = 6..597</a>
%H A271735 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%p A271735 with(combinat):
%p A271735 b:= proc(n, i, k) option remember; `if`(n=0, 1,
%p A271735       `if`(i<1, 0, add(multinomial(n, n-i*j, i$j)
%p A271735         *b(n-i*j, i-1, k)/j!, j=0..min(k, n/i))))
%p A271735     end:
%p A271735 a:= n-> b(n$2, 6)-b(n$2, 5):
%p A271735 seq(a(n), n=6..30);
%t A271735 multinomial[n_, k_List] := n!/Times @@ (k!);
%t A271735 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 A271735 a[n_] := b[n, n, 6] - b[n, n, 5];
%t A271735 Table[a[n], {n, 6, 30}] (* _Jean-François Alcover_, May 08 2018, after _Alois P. Heinz_ *)
%Y A271735 Column k=6 of A271423.
%K A271735 nonn
%O A271735 6,3
%A A271735 _Alois P. Heinz_, Apr 13 2016