cp's OEIS Frontend

A271426 Number of set partitions of [n] with minimal block length multiplicity equal to one.

%I A271426 #10 May 07 2018 09:49:43
%S A271426 0,1,1,4,11,51,132,771,3089,18388,96423,627529,3349018,24510305,
%T A271426 155908651,1171494200,8647906143,71603237483,572103586280,
%U A271426 5172888505403,43344865682187,416735802793600,3830340992280773,38239507035358011,374336654847685014
%N A271426 Number of set partitions of [n] with minimal block length multiplicity equal to one.
%C A271426 At least one block length occurs exactly once.
%H A271426 Alois P. Heinz, <a href="/A271426/b271426.txt">Table of n, a(n) for n = 0..576</a>
%H A271426 Wikipedia, <a href="https://en.wikipedia.org/wiki/Partition_of_a_set">Partition of a set</a>
%F A271426 a(n) = A271424(n,1).
%e A271426 a(1) = 1: 1.
%e A271426 a(2) = 1: 12.
%e A271426 a(3) = 4: 123, 12|3, 13|2, 1|23.
%e A271426 a(4) = 11: 1234, 123|4, 124|3, 12|3|4, 134|2, 13|2|4, 1|234, 1|23|4, 14|2|3, 1|24|3, 1|2|34.
%p A271426 with(combinat):
%p A271426 b:= proc(n, i, k) option remember; `if`(n=0, 1,
%p A271426       `if`(i<1, 0, add(multinomial(n, n-i*j, i$j)
%p A271426         *b(n-i*j, i-1, k)/j!, j={0,$k..n/i})))
%p A271426     end:
%p A271426 a:= n-> b(n$2, 1)-b(n$2, 2):
%p A271426 seq(a(n), n=0..30);
%t A271426 multinomial[n_, k_List] := n!/Times @@ (k!);
%t A271426 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, Join[{0}, Range[k, n/i]]}]]];
%t A271426 a[n_] := b[n, n, 1] - b[n, n, 2];
%t A271426 Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, May 07 2018, after _Alois P. Heinz_ *)
%Y A271426 Column k=1 of A271424.
%K A271426 nonn
%O A271426 0,4
%A A271426 _Alois P. Heinz_, Apr 07 2016