The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A327707 The minimal size of a partition lambda of n such that every partition of n with at most 7 parts can be obtained by coalescing the parts of lambda. 4
 1, 2, 3, 4, 5, 6, 7, 7, 8, 8, 9, 9, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 14, 15, 15, 15, 15, 15, 15, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 20, 20, 20, 20 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Bo Jones and John Gunnar Carlsson, Minimum size generating partitions and their application to demand fulfillment optimization problems, arXiv:1909.09363 [math.CO], 2019. FORMULA Let L(n,k) be the analogous quantity if 7 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), A327705 (k=5), A327706 (k=6), A327708 (k=8), A327709 (k=9), A327710 (k=10). Sequence in context: A209384 A060207 A195932 * A134679 A100721 A271490 Adjacent sequences:  A327704 A327705 A327706 * A327708 A327711 A327712 KEYWORD nonn AUTHOR Bo Jones, Oct 31 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 22 19:16 EST 2020. Contains 331153 sequences. (Running on oeis4.)