|
%I #37 May 21 2021 11:29:24
%S 1,0,1,1,1,1,1,1,2,2,1,2,3,2,4,4,2,1,4,6,4,1,7,8,5,2,8,11,8,3,12,15,
%T 10,4,1,14,20,15,6,1,21,26,19,9,2,24,35,27,12,3,34,45,34,17,5,41,58,
%U 47,23,6,1,55,75,59,31,10,1,66,96,79,41,13,2
%N Triangle read by rows: T(n,k) is the number of partitions of n having least gap k.
%C The "least gap" or "mex" of a partition is the least positive integer that is not a part of the partition. For example, the least gap of the partition [7,4,2,2,1] is 3.
%C Sum of entries in row n is A000041(n).
%C T(n,1) = A002865(n).
%C Sum_{k>=1} k*T(n,k) = A022567(n).
%H Alois P. Heinz, <a href="/A264401/b264401.txt">Rows n = 0..1000, flattened</a>
%H George E. Andrews and David Newman, <a href="https://doi.org/10.1007/s00026-019-00427-w">Partitions and the Minimal Excludant</a>, Annals of Combinatorics, Volume 23, May 2019, Pages 249-254.
%H P. J. Grabner and A. Knopfmacher, <a href="http://www.math.tugraz.at/fosp/pdfs/tugraz_0087.pdf">Analysis of some new partition statistics</a>, Ramanujan J., 12, 2006, 439-454.
%H Brian Hopkins, James A. Sellers, and Dennis Stanton, <a href="https://arxiv.org/abs/2009.10873">Dyson's Crank and the Mex of Integer Partitions</a>, arXiv:2009.10873 [math.CO], 2020.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Mex_(mathematics)">Mex (mathematics)</a>
%F G.f.: G(t,x) = Sum_{j>=1} (t^j*x^{j(j-1)/2}*(1-x^j))/Product_{i>=1}(1-x^i).
%e Row n=5 is 2,3,2; indeed, the least gaps of [5], [4,1], [3,2], [3,1,1], [2,2,1], [2,1,1,1], and [1,1,1,1,1] are 1, 2, 1, 2, 3, 3, and 2, respectively (i.e., two 1s, three 2s, and two 3s).
%e Triangle begins:
%e 1
%e 0 1
%e 1 1
%e 1 1 1
%e 2 2 1
%e 2 3 2
%e 4 4 2 1
%e 4 6 4 1
%e 7 8 5 2
%e 8 11 8 3
%e 12 15 10 4 1
%e 14 20 15 6 1
%e 21 26 19 9 2
%p g := (sum(t^j*x^((1/2)*j*(j-1))*(1-x^j), j = 1 .. 80))/(product(1-x^i, i = 1 .. 80)): gser := simplify(series(g, x = 0, 23)): for n from 0 to 30 do P[n] := sort(coeff(gser, x, n)) end do: for n from 0 to 25 do seq(coeff(P[n], t, j), j = 1 .. degree(P[n])) end do; # yields sequence in triangular form
%p # second Maple program:
%p b:= proc(n, i) option remember; `if`(n=0, `if`(i=0, [1, 0],
%p [0, x]), `if`(i<1, 0, (p-> [0, p[2] +p[1]*x^i])(
%p b(n, i-1)) +add(b(n-i*j, i-1), j=1..n/i)))
%p end:
%p T:= n->(p->seq(coeff(p, x, i), i=1..degree(p)))(b(n, n+1)[2]):
%p seq(T(n), n=0..20); # _Alois P. Heinz_, Nov 29 2015
%t Needs["Combinatorica`"]; {1, 0}~Join~Flatten[Table[Count[Map[If[# == {}, 0, First@ #] &@ Complement[Range@ n, #] &, Combinatorica`Partitions@ n], n_ /; n == k], {n, 17}, {k, n}] /. 0 -> Nothing] (* _Michael De Vlieger_, Nov 21 2015 *)
%t mingap[q_]:=Min@@Complement[Range[If[q=={},0,Max[q]]+1],q];Table[Length[Select[IntegerPartitions[n],mingap[#]==k&]],{n,0,15},{k,Round[Sqrt[2*(n+1)]]}] (* _Gus Wiseman_, Apr 19 2021 *)
%t b[n_, i_] := b[n, i] = If[n == 0, If[i == 0, {1, 0}, {0, x}], If[i<1, {0, 0}, {0, #[[2]] + #[[1]]*x^i}&[b[n, i-1]] + Sum[b[n-i*j, i - 1], {j, 1, n/i}]]];
%t T[n_] := CoefficientList[b[n, n + 1], x][[2]] // Rest;
%t T /@ Range[0, 20] // Flatten (* _Jean-François Alcover_, May 21 2021, after _Alois P. Heinz_ *)
%Y Row sums are A000041.
%Y Row lengths are A002024.
%Y Column k = 1 is A002865.
%Y Column k = 2 is A027336.
%Y The strict case is A343348.
%Y A000009 counts strict partitions.
%Y A000041 counts partitions.
%Y A000070 counts partitions with a selected part.
%Y A006128 counts partitions with a selected position.
%Y A015723 counts strict partitions with a selected part.
%Y A257993 gives the least gap of the partition with Heinz number n.
%Y A339564 counts factorizations with a selected factor.
%Y A342050 ranks partitions with even least gap.
%Y A342051 ranks partitions with odd least gap.
%Y Cf. A003242, A022567, A048004, A083710, A098743, A130689, A338470, A343341.
%K nonn,tabf
%O 0,9
%A _Emeric Deutsch_, Nov 21 2015
|
