cp's OEIS Frontend

A271736 Number of set partitions of [n] with maximal block length multiplicity equal to seven.

%I A271736 #8 May 08 2018 06:23:10
%S A271736 1,0,36,120,1320,8712,70356,691119,6628050,55398200,528441056,
%T A271736 5607882072,55953959256,559256993400,6033783063160,66852986570260,
%U A271736 743874599106485,8455383000184208,100088596628849400,1202568046655647100,14764362076427728050
%N A271736 Number of set partitions of [n] with maximal block length multiplicity equal to seven.
%C A271736 At least one block length occurs exactly 7 times, and all block lengths occur at most 7 times.
%H A271736 Alois P. Heinz, <a href="/A271736/b271736.txt">Table of n, a(n) for n = 7..592</a>
%H A271736 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%p A271736 with(combinat):
%p A271736 b:= proc(n, i, k) option remember; `if`(n=0, 1,
%p A271736       `if`(i<1, 0, add(multinomial(n, n-i*j, i$j)
%p A271736         *b(n-i*j, i-1, k)/j!, j=0..min(k, n/i))))
%p A271736     end:
%p A271736 a:= n-> b(n$2, 7)-b(n$2, 6):
%p A271736 seq(a(n), n=7..30);
%t A271736 multinomial[n_, k_List] := n!/Times @@ (k!);
%t A271736 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 A271736 a[n_] := b[n, n, 7] - b[n, n, 6];
%t A271736 Table[a[n], {n, 7, 30}] (* _Jean-François Alcover_, May 08 2018, after _Alois P. Heinz_ *)
%Y A271736 Column k=7 of A271423.
%K A271736 nonn
%O A271736 7,3
%A A271736 _Alois P. Heinz_, Apr 13 2016