[seqfan] Re: More about lex earliest cubefree 0,1 sequence

[Antti Karttunen]

Dear M. F. Hasler,

(concerning http://list.seqfan.eu/pipermail/seqfan/2017-May/017572.html )

Do we have (yet) a sequence that would tell how much k needs to be
decreased at step (3)
in the algorithm you describe in http://oeis.org/A282317 ?
That is, how much shorter (than the previous total length of S) each new
added segment W is at each "approximate doubling" step?

Is there any regularity to this sequence?


Best regards,

Antti Karttunen