1,2

Table of n, a(n) for n=1..76.

Bo Jones and John Gunnar Carlsson, Minimum size generating partitions and their application to demand fulfillment optimization problems, arXiv:1909.09363 [math.CO], 2019.

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.

Cf. A327704 (k=4), A327705 (k=5), A327706 (k=6), A327708 (k=8).

Sequence in context: A209384 A060207 A195932 * A134679 A100721 A265359

Adjacent sequences: A327704 A327705 A327706 * A327708 A327709 A327710

nonn

Bo Jones, Oct 31 2019

approved