cp's OEIS Frontend

A239952 Number of partitions of n such that (number of distinct parts) >= least part.

%I A239952 #17 Nov 17 2015 01:32:01
%S A239952 0,1,1,2,3,6,8,13,18,26,36,50,68,92,123,162,214,279,360,464,595,754,
%T A239952 959,1206,1513,1893,2358,2918,3615,4451,5462,6691,8174,9940,12081,
%U A239952 14631,17675,21314,25637,30763,36861,44059,52555,62600,74417,88287,104600,123716
%N A239952 Number of partitions of n such that (number of distinct parts) >= least part.
%H A239952 Alois P. Heinz, <a href="/A239952/b239952.txt">Table of n, a(n) for n = 0..1000</a>
%F A239952 a(n) + A239948(n) = A000041(n) for n >= 0.
%e A239952 a(6) counts these 8 partitions:  51, 42, 411, 321, 3111, 2211, 21111, 111111.
%p A239952 b:= proc(n, i, d) option remember; `if`(n=0, 1, `if`(i<=d+1, 0,
%p A239952       add(b(n-i*j, i-1, d+`if`(j=0, 0, 1)), j=0..n/i)))
%p A239952     end:
%p A239952 a:= n-> combinat[numbpart](n) -b(n$2, 0):
%p A239952 seq(a(n), n=0..60);  # _Alois P. Heinz_, Apr 02 2014
%t A239952 z = 50; d[p_] := d[p] = Length[DeleteDuplicates[p]]; f[n_] := f[n] = IntegerPartitions[n];
%t A239952 Table[Count[f[n], p_ /; d[p] < Min[p]], {n, 0, z}]  (*A239948*)
%t A239952 Table[Count[f[n], p_ /; d[p] <= Min[p]], {n, 0, z}] (*A239949*)
%t A239952 Table[Count[f[n], p_ /; d[p] == Min[p]], {n, 0, z}] (*A239950*)
%t A239952 Table[Count[f[n], p_ /; d[p] > Min[p]], {n, 0, z}]  (*A239951*)
%t A239952 Table[Count[f[n], p_ /; d[p] >= Min[p]], {n, 0, z}] (*A239952*)
%t A239952 b[n_, i_, d_] := b[n, i, d] = If[n==0, 1, If[i<=d+1, 0, Sum[b[n-i*j, i-1, d + If[j==0, 0, 1]], {j, 0, n/i}]]]; a[n_] := PartitionsP[n] - b[n, n, 0]; Table[a[n], {n, 0, 60}] (* _Jean-François Alcover_, Nov 17 2015, after _Alois P. Heinz_ *)
%Y A239952 Cf. A239948, A239949, A239950, A239951.
%K A239952 nonn,easy
%O A239952 0,4
%A A239952 _Clark Kimberling_, Mar 30 2014