Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #13 Apr 10 2021 20:29:41
%S 1,2,3,4,5,6,6,7,7,8,8,9,9,9,10,10,10,11,11,11,11,12,12,12,12,12,13,
%T 13,13,13,13,13,14,14,14,14,14,14,14,15,15,15,15,15,15,15,15,16,16,16,
%U 16,16,16,16,16,16,16,17,17,17,17,17,17,17,17,17,17,17,17,18,18,18,18,18,18,18,18,18,18,18,18,18,18
%N The minimal size of a partition lambda of n such that every partition of n with at most 6 parts can be obtained by coalescing the parts of lambda.
%H Bo Jones and John Gunnar Carlsson, <a href="https://arxiv.org/abs/1909.09363">Minimum size generating partitions and their application to demand fulfillment optimization problems</a>, arXiv:1909.09363 [math.CO], 2019.
%F Let L(n,k) be the analogous quantity if 6 is changed to k. Then L(n,k) = 1 + L(floor(n*(k-1)/k), k) with L(0,k) = 0.
%Y Cf. A327704 (k=4), A327705 (k=5), A327707 (k=7), A327708 (k=8).
%K nonn
%O 1,2
%A _Bo Jones_, Oct 31 2019