login

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”).

A327705
The minimal size of a partition lambda of n such that every partition of n with at most 5 parts can be obtained by coalescing the parts of lambda.
4
1, 2, 3, 4, 5, 5, 6, 6, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17
OFFSET
1,2
FORMULA
Let L(n,k) be the analogous quantity if 5 is changed to k. Then L(n,k) = 1 + L(floor(n*(k-1)/k), k) with L(0,k) = 0.
CROSSREFS
Cf. A327704 (k=4), A327706 (k=6), A327707 (k=7), A327708 (k=8).
Sequence in context: A005245 A061373 A372306 * A104135 A354535 A276656
KEYWORD
nonn
AUTHOR
Bo Jones, Sep 22 2019
STATUS
approved